#include<bits/stdc++.h> #include<iostream> #include<cmath> using namespace std; struct stu{ string name; int a,b,c; long long sum=0; long long num=0; }; bool cmp(stu n,stu m){ if(n.sum!=m.sum) return n.sum>m.sum; else{ if(n.a!=m.a) return n.a>m.a; else{ if(n.b!=m.b) return n.b>m.b; else return n.num<m.num; } } } int main(){ stu a[100005]; int b; cin >>b; for(int i=1;i<=b;i++){ cin >>a[i].name>>a[i].a>>a[i].b>>a[i].c; a[i].sum+=a[i].a+a[i].b+a[i].c; a[i].num=i; } sort(a+1,1+b+a,cmp); for(int i =1;i<=b;i++){ cout <<a[i].name<<' '<<a[i].sum<<endl; } return 0; }

#include <iostream> #include <algorithm> using namespace std; long long n; struct node { string name; int a,b,c,id; int sum; void in() { cin>>name>>a>>b>>c; sum=a+b+c; } void out() { cout<<name<<" "<<sum<<endl; } }arr[1000005]; bool cmp(node a,node b) { if(a.sum!=b.sum)return a.sum>b.sum; if(a.a!=b.a)return a.a>b.a; if(a.b!=b.b)return a.b>b.b; return a.id<b.id; } int main() { cin>>n; for(int i=0;i<n;i++) { arr[i].in(); arr[i].id=i+1; } sort(arr,arr+n,cmp); for(int i=0;i<n;i++) { arr[i].out(); } }

#include<bits/stdc++.h> using namespace std; struct asd{ char name[25]; int jng,ing,tng,sum=0; int id; }a[100000]; bool cmp(asd x,asd y){ if(x.sum!=y.sum)return x.sum>y.sum; if(x.jng!=y.jng)return x.jng>y.jng; if(x.ing!=y.ing)return x.ing>y.ing; return x.id<y.id; } int n; int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i].name>>a[i].jng>>a[i].ing>>a[i].tng; a[i].id=i; a[i].sum=a[i].jng+a[i].ing+a[i].tng; } sort(a+1,a+n+1,cmp); for(int i=1;i<=n;i++)printf("%s %d\n",a[i].name, a[i].sum); return 0; }

代码cmp简化与id思路来自榜一法姐和榜三想学，可以看看他们的，比我好

#include <iostream> #include <vector> #include <algorithm> #include <string> using namespace std; // 定义一个结构体来存储选手的信息 struct Athlete { string name; int gold; int silver; int bronze; int total; // 总奖牌数 int index; // 记录输入顺序 }; // 比较函数，用于排序 bool compare(const Athlete& a, const Athlete& b) { if (a.total != b.total) return a.total > b.total; // 首先按总奖牌数排序 if (a.gold != b.gold) return a.gold > b.gold; // 然后按金牌数排序 if (a.silver != b.silver) return a.silver > b.silver; // 然后按银牌数排序 return a.index < b.index; // 如果都相同，按输入顺序输出 } int main() { int n; cin >> n; vector<Athlete> athletes(n); } 简单

第一种解法 #include <bits/stdc++.h> using namespace std; struct student{ char s[25]; int a, b, c, sum = 0, id; }; bool compareStudent(student x, student y) { if(x.sum != y.sum) return x.sum > y.sum; if(x.a != y.a) return x.a > y.a; if(x.b != y.b) return x.b > y.b; return x.id < y. id; } int main() { student stu[100010]; int n; cin >> n; for(int i = 0; i < n; i++) { cin >> stu[i].s >> stu[i].a >> stu[i].b >> stu[i].c; stu[i].sum = stu[i].a + stu[i].b + stu[i].c; stu[i].id = i; } sort(stu, stu + n, compareStudent); for(int i = 0; i < n; i++) { printf("%s %d\n",stu[i].s, stu[i].sum); } return 0; } 第二种解法 /*#include <bits/stdc++.h> using namespace std; struct stu{ string name; long long a,b,c; long long z; }l[100010]; int main(){ int n;cin>>n; }*/

#include<bits/stdc++.h> using namespace std; struct aaa{ string s; int aa; int bb; int cc; int dd=aa+bb+cc; int ee; }a[100005]; bool cmp(aaa a,aaa b){ if(a.dd!=b.dd)return a.dd>b.dd; else if(a.aa!=b.aa)return a.aa>b.aa; else if(a.bb!=b.bb)return a.bb>b.bb; return a.ee<b.ee; } int main(){ int n; cin>>n; for(int i=0;i<n;i++){ cin>>a[i].s >>a[i].aa>>a[i].bb>>a[i].cc; a[i].dd=a[i].aa+a[i].bb+a[i].cc; a[i].ee=i+1; } sort(a,a+n,cmp); for(int i=0;i<n;i++){ cout<<a[i].s<<" "<<a[i].dd << endl; } return 0; }