I-Solving Order

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<math.h>
using namespace std;
struct haha {
    string color;
    int num;
}a[2222];
bool cmp(haha a, haha b) {
    return a.num > b.num;
}
int main()
{
    int t, m;
    cin >> t;
    while (t--)
    {
        cin >> m;
        for (int i = 0; i < m; i++)
        {
            cin >> a[i].color >> a[i].num;
        }
        sort(a, a + m, cmp);
        for (int i = 0; i < m-1; i++)
        {
            cout << a[i].color <<' ';
        }
        cout<<a[m-1].color<<endl;
    }
    return 0;
}