0分求条（必关）

#include <iostream>
using namespace std;
int main() {
    int n;
    cin >> n;
    string id[101];
    int a[101];
    for (int i = 1; i <= n; i++) {
        cin >> id[i] >> a[i];
    }
    string l[101], fl[101];
    int t = 0, s = 0;
    for (int i = 1; i <= n; i++) {
        if (a[i] >= 60) {
            t++;
            l[t] = id[i];
        } else {
            s++;
            fl[s] = id[i];
        }
    }
    for (int i = 1; i <= t; i++) {
        if (a[i] > a[i + 1]) {
            swap (l[i], l[i + 1]);
            swap (a[i], a[i + 1]);
        }
    }
    if (a[1] > a[2]) {
        swap (l[1], l[2]);
        swap (a[1], a[2]);
    }
    for (int i = 1; i <= t; i++) {
        cout << l[i] << endl;
    }
    for (int i = 1; i <= n - t; i++) {
        cout << fl[i] << endl;
    }
}