Sort_1

#include <iostream>
#include <math.h>

using namespace std;

void quicksort(int *tablica1, int *tablica2, int *tablica3, string *tablica4, int lewy, int prawy){
    int v=tablica1[(lewy+prawy)/2];
    int i,j,x,a,b;
    string c;
    i=lewy;
    j=prawy;
    do{
        while (tablica1[i]<v) i++;
        while (tablica1[j]>v) j--;
        if (i<=j){
            x=tablica1[i];
            a=tablica2[i];
            b=tablica3[i];
            c=tablica4[i];
            tablica1[i]=tablica1[j];
            tablica2[i]=tablica2[j];
            tablica3[i]=tablica3[j];
            tablica4[i]=tablica4[j];
            tablica1[j]=x;
            tablica2[j]=a;
            tablica3[j]=b;
            tablica4[j]=c;
            i++; j--;
            }
        }while (i<=j);
    if (j>lewy) quicksort(tablica1,tablica2,tablica3,tablica4,lewy, j);
    if (i<prawy) quicksort(tablica1,tablica2,tablica3,tablica4, i, prawy);
}
int main(){
    int t,n,sumadwochbokowkwadrat;
    cin>>t;
    for(int i=0;i<t;i++){
        cin>>n;
        int pitagoras[n],x[n],y[n];
        string nazwa[n];
        for(int j=0;j<n;j++){
            cin>>nazwa[j]>>x[j]>>y[j];
            sumadwochbokowkwadrat=pow(x[j],2)+pow(y[j],2);
            pitagoras[j]=pow(sumadwochbokowkwadrat,0.5);
            }
        cout<<endl;
    quicksort(pitagoras,x,y,nazwa,0,n-1);
    for (int j=0;j<n;j++)
        cout<<nazwa[j]<<" "<<x[j]<<" "<<y[j]<<endl;
    cout<<endl;
    }
    return 0;
}