题目传送门
从前都没试过 vectorv,ans;
怪我孤陋寡闻了
用了之后只有一个字 好！

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<map>
#include<vector>
using namespace std;
struct node{string name;int p,m,f,g;
};map<string,int>mp;
bool cmp(node a,node b){return a.g != b.g ? a.g > b.g : a.name < b.name;
}
int main()
{string s;int P,M,N,i,j,score,cnt=1;cin>>P>>M>>N;vector<node>v,ans;for(i=0;i<P;i++){cin>>s>>score;if(score>=200){v.push_back(node{s,score,-1,-1,0});mp[s]=cnt++;}}for(i=0;i<M;i++){cin>>s>>score;if(mp[s]!=0){v[mp[s]-1].m=score;}}for(i=0;i<N;i++){cin>>s>>score;if(mp[s]!=0){int tmp=mp[s]-1;v[tmp].g=v[tmp].f=score;if(v[tmp].m>v[tmp].f)v[tmp].g=int(v[tmp].m*0.4+v[tmp].f*0.6+0.5);}}for(i=0;i<v.size();i++){if(v[i].g>=60)ans.push_back(v[i]);}sort(ans.begin(),ans.end(),cmp);for(i=0;i<ans.size();i++){printf("%s %d %d %d %d\n",ans[i].name.c_str(),ans[i].p,ans[i].m,ans[i].f,ans[i].g);}return 0;
}