题解

#include<iostream>
#include<algorithm>
using namespace std;

struct wp
{
    string name;
    int atk,pri;
};

bool cmp(wp a,wp b)
{
	if(a.atk > b.atk)
		return true;
	else if(a.atk < b.atk)
		return false;
	else
		return a.pri < b.pri;
}

int main()
{
	int n,k;
	cin>>n>>k;
	wp my[n];
	for(int i=0; i<n; i++)
	{
		cin >> my[i].name >> my[i].atk >> my[i].pri;
	}
	
	sort(my, my+n, cmp);
	
	for(int i=0; i<k; i++)
	{
		cout << my[i].name << endl;
	}
	return 0;
}