第四章排序 4 AcWing 1505. 列表排序

古城微笑少年丶 2023-09-24 13:55 51阅读 0赞

## 第四章 排序 4 AcWing 1505. 列表排序 ##

### 原题链接 ###

[AcWing 1505. 列表排序][AcWing 1505.]

### 算法标签 ###

排序

### 思路 ###

依题意模拟

### 代码 ###

#pragma GCC optimize(2)
    #pragma GCC optimize(3)
    #include<bits/stdc++.h>
    using namespace std;
    #define int long long
    #define x first
    #define y second
    #define ump unordered_map
    #define pq priority_queue
    #define pii pair<int, int>
    #define rep(i, a, b) for(int i=a; i<b; ++i)
    #define Rep(i, a, b) for(int i=a; i>=b; --i)
    #define debug(a) cout<<#a<<"="<<a<<endl;
    #define debugi(i) printf("i = %lld\n", i)
    const int N=100005;
    int n, m;
    ump<string, vector<int>> gra;
    vector<int> q[4];
    inline int rd(){
        int s=0, w=1;
        char ch=getchar();
        while(ch<'0'||ch>'9'){
            if(ch=='-'){
                w=-1;    
            }
            ch=getchar();
        }
        while(ch>='0'&&ch<='9'){
            s=s*10+ch-'0';
            ch=getchar();
        }
        return s*w;
    }
    struct Rec{
        string id, name;
        int score;
    }rec[N];
    bool cmp(Rec A, Rec B){
        return A.id<B.id;
    }
    bool cmp1(Rec A, Rec B){
        if(A.name==B.name){
            return A.id<B.id;
        }else{
            return A.name<=B.name;
        }
    }
    bool cmp2(Rec A, Rec B){
        if(A.score==B.score){
            return A.id<B.id;
        }else{
            return A.score<=B.score;
        }
    }
    
    signed main(){
        ios::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        int n,c;
        cin>>n>>c;
        string id, name;
        int score;
        rep(i, 0, n){
            cin>>id>>name>>score;
            rec[i].id=id, rec[i].name=name, rec[i].score=score; 
        }
        if(c==1){
            sort(rec, rec+n, cmp);
            rep(i,0, n){
                cout<<rec[i].id<<" "<<rec[i].name<<" "<<rec[i].score<<"\n";
            }
        }else if(c==2){
            sort(rec, rec+n, cmp1);
            rep(i,0, n){
                cout<<rec[i].id<<" "<<rec[i].name<<" "<<rec[i].score<<"\n";
            }
        }else if(c==3){
            sort(rec, rec+n, cmp2);
            rep(i,0, n){
                cout<<rec[i].id<<" "<<rec[i].name<<" "<<rec[i].score<<"\n";
            }
        }
        return 0;
    }

原创不易  
转载请标明出处  
如果对你有所帮助 别忘啦点赞支持哈  
![在这里插入图片描述][9cb4cb80a18345158f8a69e2f196e5b9.png]

[AcWing 1505.]: https://www.acwing.com/problem/content/1507/
[9cb4cb80a18345158f8a69e2f196e5b9.png]: https://img-blog.csdnimg.cn/9cb4cb80a18345158f8a69e2f196e5b9.png