2 条题解

  • 0
    @ 2026-4-7 12:37:39

    #include<bits/stdc++.h> using namespace std; struct st{ int xh; string s; int fs; }; int n; st a[110]; bool cmp(st s1,st s2){ if(s1.fs==s2.fs){ return s1.xh<s2.xh; }else{ return s1.fs>s2.fs; } } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i].xh>>a[i].s>>a[i].fs; } sort(a+1,a+1+n,cmp); for(int i=1;i<=n;i++){ cout<<a[i].xh<<" "<<a[i].s<<" "<<a[i].fs<<endl; } return 0; }

    • 0
      @ 2026-3-29 11:02:11
      
      
      #include<bits/stdc++.h>
      using namespace std;
      struct st{
      	int xh;
      	string s;
      	int fs; 
      };
      int n;
      st a[110];
      bool cmp(st s1,st s2){
      	if(s1.fs==s2.fs){
      		return s1.xh<s2.xh;
      	}else{
      		return s1.fs>s2.fs;
      	}
      }
      int main(){
      	cin>>n;
      	for(int i=1;i<=n;i++){
      		cin>>a[i].xh>>a[i].s>>a[i].fs;
      	}
          sort(a+1,a+1+n,cmp);
      	for(int i=1;i<=n;i++){
      		cout<<a[i].xh<<" "<<a[i].s<<" "<<a[i].fs<<endl;
      	}
      	return 0;
      }
      
      
      • 1

      信息

      ID
      4780
      时间
      1000ms
      内存
      16MiB
      难度
      2
      标签
      递交数
      8
      已通过
      4
      上传者