CC BY 4.0 （除特别声明或转载文章外）
如果这篇博客帮助到你，可以请我喝一杯咖啡~
Quailty and CCPC
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
#include <bits/stdc++.h>
using namespace std;
struct Team
{
int penalty, timu, id;
bool operator<(const Team &q) const
{
return timu == q.timu ? penalty < q.penalty : timu > q.timu;
}
} tt[1004000];
char s[1000040][20];
int n, m, t;
int main(void)
{
scanf("%d", &t);
while (t--)
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%s%d%d", s[i], &tt[i].timu, &tt[i].penalty), tt[i].id = i;
if (n * m % 10 == 5)
{
sort(tt + 1, tt + n + 1);
printf("%s\n", s[tt[n * m / 10 + 1].id]);
}
else
puts("Quailty is very great");
}
}