【HDOJ6666】Quailty and CCPC（模拟）

题意：给出罚时现场赛的题数和罚时，问是否有在金牌线下取整被卡出，四舍五入卡入的队伍

n<=1e5

思路：

 #include<bits/stdc++.h>
 using namespace std;
 typedef long long ll;
 typedef unsigned int uint;
 typedef unsigned long long ull;
 typedef pair<int,int> PII;
 typedef pair<ll,ll> Pll;
 typedef vector<int> VI;
 typedef vector<PII> VII;
 #define N  110000
 #define M  4100000
 #define fi first
 #define se second
 #define MP make_pair
 #define pi acos(-1)
 #define mem(a,b) memset(a,b,sizeof(a))
 #define rep(i,a,b) for(int i=(int)a;i<=(int)b;i++)
 #define per(i,a,b) for(int i=(int)a;i>=(int)b;i--)
 #define lowbit(x) x&(-x)
 #define Rand (rand()*(1<<16)+rand())
 #define id(x) ((x)<=B?(x):m-n/(x)+1)
 #define ls p<<1
 #define rs p<<1|1

 const ll MOD=1e9+,inv2=(MOD+)/;
       double eps=1e-;
       int INF=1e9;

 int read()
 {
    int v=,f=;
    char c=getchar();
    while(c<||<c) {if(c=='-') f=-; c=getchar();}
    while(<=c&&c<=) v=(v<<)+v+v+c-,c=getchar();
    return v*f;
 }

 struct arr
 {
     char x[];
     int y,z;
 }a[N];

 bool cmp(arr a,arr b)
 {
     if(a.y==b.y) return a.z<b.z;
     return a.y>b.y;
 }

 int main()
 {
     //freopen("1.in","r",stdin);
     int cas;
     scanf("%d",&cas);
     while(cas--)
     {
         int n=read(),d=read();
         rep(i,,n)
         {
             scanf("%s",a[i].x+);
             a[i].y=read();
             a[i].z=read();
         }
         sort(a+,a+n+,cmp);
         int x1=1.0*n*d/10.0;
         int x2=x1;
         if(n*d%==) x2++;
         int flag=;
         //printf("x1=%d x2=%d\n",x1,x2);
         rep(i,,n)
          if(i>x1&&i<=x2)
          {
             flag=;
             printf("%s\n",a[i].x+);
          }
          if(!flag) printf("Quailty is very great\n");

     }

     return ;
 }