#include<bits/stdc++.h> using namespace std; struct node{ string school,team; int solved,time; }a,b[200005]; bool cmp(node a,node b){ if(a.solved!=b.solved) return a.solved>b.solved;//按照解题数 else return a.time<b.time;//按照用时 } int main(){ int n,k=0; string s;//s奖 cin>>n; for(int i=1;i<=n;i++){ cin>>a.school>>a.team>>a.solved>>a.time; if(a.team.find('')==-1&&a.solved!=0){ b[++k]=a; } } sort(b+1,b+k+1,cmp); int J=ceil(k0.1);//金牌 int Y=ceil(k0.3)-J;//银牌 int T=ceil(k0.6)-Y-J;//铜牌 cin>>s; if(s=="gold"){ cout<<J<<endl; for(int i=1;i<=J;i++){ cout<<b[i].school<<" "<<b[i].team<<" "<<b[i].solved<<" "<<b[i].time<<endl; } } else if(s=="silver"){ cout<<Y<<endl; for(int i=J+1;i<=J+Y;i++){ cout<<b[i].school<<" "<<b[i].team<<" "<<b[i].solved<<" "<<b[i].time<<endl; } } else{ cout<<T<<endl; for(int i=J+Y+1;i<=J+Y+T;i++){ cout<<b[i].school<<" "<<b[i].team<<" "<<b[i].solved<<" "<<b[i].time<<endl; } } return 0; }