PAT A1062 Talent and Virtue　——西北望长安，可怜无数山

最新推荐文章于 2021-02-14 18:50:38 发布

淘学书童Ｑ

最新推荐文章于 2021-02-14 18:50:38 发布

阅读量121

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/weixin_40852534/article/details/107089851

版权

PAT 专栏收录该内容

58 篇文章 0 订阅

订阅专栏

PAT A1062 Talent and Virtue

按要求梳理好排序的项目
cin cout with string大失败

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>

using namespace std;


struct People{
    char ID[10];
    int virtue;
    int talent;
    int total;
    int kind;
};
vector<People> vp;

bool cmp(People p1,People p2){
    if(p1.kind != p2.kind) return p1.kind > p2.kind;
    else if(p1.total != p2.total) return p1.total > p2.total;
    else if(p1.virtue != p2.virtue) return p1.virtue > p2.virtue;
    else return strcmp(p1.ID,p2.ID) < 0;
}

int main(){
    
    int num,L,H;
    //cin >> num >> L >> H;
    scanf("%d %d %d",&num,&L,&H);
    for(int i = 0;i < num;i ++){
        People tmp;
        //cin >> tmp.ID >> tmp.virtue >> tmp.talent;
        scanf("%s %d %d",tmp.ID,&tmp.virtue,&tmp.talent);
        if(tmp.virtue < L || tmp.talent < L) continue;
        tmp.total = tmp.virtue + tmp.talent;
        if(tmp.virtue >= H && tmp.talent >= H) tmp.kind = 4;
        else if(tmp.virtue >= H && tmp.talent < H) tmp.kind = 3;
        else if(tmp.virtue >= tmp.talent) tmp.kind = 2;
        else tmp.kind = 1;
        vp.push_back(tmp);
    }
    sort(vp.begin(),vp.end(),cmp);
    //cout << vp.size() << endl;
    printf("%d\n",vp.size());
    for(int i = 0;i < vp.size();i ++){
        //cout << vp[i].ID << ' ' << vp[i].virtue << ' ' << vp[i].talent << endl;
        printf("%s %d %d\n",vp[i].ID,vp[i].virtue,vp[i].talent);
    }
    return 0;
}