华为OJ中级题-成绩排序

查找和排序
题目：输入任意（用户，成绩）序列，可以获得成绩从高到低或从低到高的排列,相同成绩
都按先录入排列在前的规则处理。

struct atx{
    string name;
    int score;
};
bool cmp(atx a, atx b){
    return a.score > b.score;
}
void hwOJ(){
    vector<atx> people;
    atx tmp;
    int N = 0, n = 0,sw=0;
    cin >> N>>sw;
    n = N;
    while (n--){
        cin >> tmp.name >> tmp.score;
        people.push_back(tmp);
    }
    sort(people.begin(), people.end(), cmp);
    if (sw == 1){ reverse(people.begin(), people.end()); }
    int len = people.size();
    for (int i = 0; i < len; ++i){
        cout << people.at(i).name << " " << people.at(i).score << endl;
    }
}