Given your constraint why not just write your own sort function. Inside the sort function maintain all the arrays like:
- Find the lowest item. Say it is at index 5. Now swap item@index5 with item@index0 in all 3 arrays.
- Repeat the above logic starting from index 1...