quailty and ccpc

hdoj-6666

题目很简单，按照题目的意思模拟就行了，排序。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
using namespace std;
struct node{
    string name;
    int num;
    int time;
    node(){}
    node(string s,int a,int b):name(s),num(a),time(b){}
    bool operator<(const node& t)const{
        if(num==t.num){
            return time<t.time;
        }
        return num>t.num;
    }
};
node team[100005];
int n,d;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--){
        cin>>n>>d;
        string s;
        int num,time;
        for(int i=0;i<n;i++){
            cin>>s>>num>>time;
            team[i]=node(s,num,time);
        }
        sort(team,team+n);
        int total=n*d;
        if(total%10!=5){
            cout<<"Quailty is very great"<<endl;
        }else{
            total/=10;
            cout<<team[total].name<<endl;
        }
    }
    return 0;
}

原文地址：https://www.cnblogs.com/GarrettWale/p/11373754.html