题解

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int n,k;
struct awa{
    string name;
    int atk,pri;
}a[105];
bool cmp(awa x,awa y){
    if(x.atk!=y.atk){
        return x.atk>y.atk;
    }
    return x.pri<y.pri;
}
int main(){
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>a[i].name>>a[i].atk>>a[i].pri;
    }
    sort(a+1,a+1+n,cmp);
    for(int i=1;i<=k;i++){
        cout<<a[i].name<<endl;
    }
}