0 pts 求调

#include <bits/stdc++.h>
using namespace std;

struct P
{
    string id;
    int ag;
    int rk;
}p[110];

bool cmp(P x, P y)
{
    bool sx = (x.ag >= 60);
    bool sy = (y.ag >= 60);
    if (sx != sy) return sx;
    if (sx && sy)
	{
        if (x.ag != y.ag) return x.ag > y.ag; 
        return x.rk < y.rk;
    }
    return x.rk < y.rk;
}

int n;

int main()
{
	cin >> n;
	for (int i = 1; i <= n; i ++ )
	{
		cin >> p[i].id >> p[i].ag;
		p[i].rk = i;
	}

	sort(p, p + n, cmp);
	
	for (int i = 1; i <= n; i ++ ) cout << p[i].id << '\n'; 
	
	return 0;	
}