正常结构体cmp排序题解

#include <bits/stdc++.h>
using namespace std;
struct war{
string name;
int atk;
int yuan;
}p[10005];
bool cmp(war x,war y){
if(x.atk!=y.atk){
return x.atk>y.atk;
}else{
return x.yuan<y.yuan;
}
}
int main(){
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>p[i].name>>p[i].atk>>p[i].yuan;
}
sort(p+1,p+n+1,cmp);
for(int i=1;i<=k;i++){
cout<<p[i].name<<endl;
}
return 0;
}