使用map<string, int>进行映射即可

#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N = 1e4 + 5;
map<string, int>mp;
int tot;struct node {string id;double gp;double gmd = -1, gfin;double g;bool operator<(const node& t) const { //排序规则if (g != t.g)return g > t.g;return id < t.id;}
}peo[N];int main()
{int p, m, n;cin >> p >> m >> n;for (int i = 0; i < p; i++) {string id;double score;cin >> id >> score;if (score >= 200) { //至少平时分得够是吧mp[id] = tot;peo[tot].id = id;peo[tot++].gp = score;}}for (int i = 0; i < m; i++) {string id;double gmd;cin >> id >> gmd;if (mp[id]) { //至少平时分得够是吧，计算期中peo[mp[id]].gmd = gmd;}}vector<node>v;for (int i = 0; i < n; i++) {string id;double gfin;cin >> id >> gfin;if (mp[id]) { //至少平时分得够int ind = mp[id];peo[ind].gfin = gfin;if (peo[ind].gmd > gfin) { //计算期末，并四舍五入peo[ind].g = round(peo[ind].gmd * 0.4 + gfin * 0.6);}elsepeo[ind].g = round(gfin);if (peo[ind].g >= 60) v.push_back(peo[ind]);}}//排序并输出sort(v.begin(), v.end());for (int i = 0; i < v.size(); i++){cout << v[i].id << ' ' << v[i].gp << ' ' << v[i].gmd << ' ' << v[i].gfin << ' ' << v[i].g << endl;}return 0;
}