#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define inf 0x3f3f3f3f
const int N=100+5;
int n,m;
struct node{
string name;
int cnt,sum;
}a[N];
bool cmp(node a,node b){
return a.cnt==b.cnt?a.sum<b.sum:a.cnt>b.cnt;
}
void solve(){
cin>>n;
for(int i=1;i<=n;i++){
int k,x;
cin>>a[i].name>>k;
set<int>s;
a[i].sum=k;
while(k--){
cin>>x;
s.insert(x);
}
a[i].cnt=s.size();
}
sort(a+1,a+n+1,cmp);
int f=1;
if(n<3){
int f=1;
for(int i=1;i<=n;i++){
if(f) f=0;else cout<<" ";
cout<<a[i].name;
}
for(int i=1;i<=3-n;i++){
if(f) f=0;else cout<<" ";
cout<<"-";
}
}
else{
for(int i=1;i<=3;i++){
cout<<a[i].name<<" \n"[i==3];
}
}
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t=1;
// cin>>t;
while(t--) solve();
return 0;
}
PTAL2-021 点赞狂魔
于 2024-03-11 17:01:08 首次发布