English foundation:

题目:http://acm.hdu.edu.cn/contests/contest_showproblem.php?pid=1010&cid=855
分析:

代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
struct team
{
    char s[15];
    int p,t;
}te[100005];
bool cmp(team x,team y)
{
    if(x.p==y.p) return x.t<y.t;
    else 	     return x.p>y.p;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int num,d;
        scanf("%d%d",&num,&d);
        for(int i=0;i<num;i++)
        {
            scanf("%s",te[i].s);
            scanf("%d%d",&te[i].p,&te[i].t);
        }
        if(num*d%10!=5)
		{
            puts("Quailty is very great");
            continue;
        }
        else
		{
            sort(te,te+num,cmp);
            int x=ceil(num*0.1*d)-1;
            printf("%s\n",te[x].s);
        }
    } 
} 
原文:https://www.cnblogs.com/dragondragon/p/11358048.html