2 条题解

  • 0
    @ 2024-6-1 11:30:35
    #include<iostream>
    #include<algorithm>
    using namespace std;
    struct jiangPai{
    	int id;
    	int jiangPaiShu;
    
    };
    bool cmp(jiangPai a,jiangPai b){
    	if(a.jiangPaiShu==b.jiangPaiShu)
    		return a.id<b.id;
    	else
    		return a.jiangPaiShu>b.jiangPaiShu;
    }
    int main(){	 //c++16级奖牌榜 
    	jiangPai jp[201];
    	int n;
    	cin>>n;
    	for(int i=0;i<n;i++){
    		cin>>jp[i].id>>jp[i].jiangPaiShu;
    	}
    	sort(jp,jp+n,cmp);
    	for(int i=0;i<n;i++){
    		cout<<jp[i].id<<" "<<jp[i].jiangPaiShu<<endl;
    	}
    	return 0;
    }
    
    
    • 0
      @ 2023-8-19 10:21:46
      #include<iostream>
      #include<algorithm>
      using namespace std;
      struct jiangPai{
      	int id;
      	int jiangPaiShu;
      
      };
      bool cmp(jiangPai a,jiangPai b){
      	if(a.jiangPaiShu==b.jiangPaiShu)
      		return a.id<b.id;
      	else
      		return a.jiangPaiShu>b.jiangPaiShu;
      }
      int main(){	 //c++16级奖牌榜 
      	jiangPai jp[201];
      	int n;
      	cin>>n;
      	for(int i=0;i<n;i++){
      		cin>>jp[i].id>>jp[i].jiangPaiShu;
      	}
      	sort(jp,jp+n,cmp);
      	for(int i=0;i<n;i++){
      		cout<<jp[i].id<<" "<<jp[i].jiangPaiShu<<endl;
      	}
      	return 0;
      }
      
      • 1

      信息

      ID
      1128
      时间
      1000ms
      内存
      256MiB
      难度
      9
      标签
      (无)
      递交数
      10
      已通过
      9
      上传者