The 15th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple - L
Doki Doki Literature Club
思路:注意字典顺序还有值的大小。
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<map>
#include<algorithm>
using namespace std;
//1-boy,0-gril
struct node{
string s;
long long happy;//数值大小
bool operator <(const node &u)const{
if(happy!=u.happy) return happy>u.happy;
else return s<u.s;
}
}words[100+10];
int main()
{
int T;
int n,m;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++)
cin>>words[i].s>>words[i].happy;
sort(words,words+n);
long long ans=0;
for(int i=0;i<m;i++)
ans+=words[i].happy*(m-i);
printf("%lld",ans);
for(int i=0;i<m;i++)
cout<<" "<<words[i].s;
cout<<endl;
}
return 0;
}