1 条题解
-
0
#include<bits/stdc++.h> using namespace std;
struct Stu { int zf; int yw; int sy; int yy; int xh; };
bool cmp(Stu a,Stu b) { if(a.zf != b.zf )return a.zf > b.zf ; else if (a.zf == b.zf && a.yw == b.yw) return a.xh < b.xh; else if (a.zf == b.zf && a.yw != b.yw) return a.yw > b.yw; } Stu p[310]; int main() { int n; cin >> n; for(int i = 1; i <= n; i++) { cin >> p[i].yw >> p[i].sy >> p[i].yy; p[i].zf = p[i].sy+p[i].yw+p[i].yy; p[i].xh = i; }
sort(p+1, p+1+n,cmp); for(int i = 1; i <=5; i++) { cout << p[i].xh << " " << p[i].zf << endl; } return 0;
}
- 1
信息
- ID
- 244
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- 6
- 标签
- 递交数
- 34
- 已通过
- 13
- 上传者