AcWing 429. 奖学金
原题链接
简单
作者:
wjie
,
2021-01-17 12:33:29
,
所有人可见
,
阅读 375
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 305;
struct Node{
int id, chinese, english, sum;
bool operator < (const Node& a) const {
if (sum != a.sum) return sum > a.sum;
if (chinese != a.chinese) return chinese > a.chinese;
return id < a.id;
}
}nodes[N];
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i)
{
nodes[i].id = i + 1;
scanf("%d%d%d", &nodes[i].chinese, &nodes[i].english, &nodes[i].sum);
nodes[i].sum += nodes[i].chinese + nodes[i].english;
}
sort(nodes, nodes+n);
for (int i = 0; i < 5; ++i) printf("%d %d\n", nodes[i].id, nodes[i].sum);
return 0;
}