noip模拟-确定的位置（map + vector）

#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<iostream>
#include<map>
#include<string>
#include<vector>
#include<sstream>
#define INF 0xfffffff
using namespace std;
int n, m, k;
int a, b, c, d;
int sum, ans, num, cnt[105];
string s, sa, sb;
map<string, int>aaa;
vector<string>vv[105];
vector<string>::iterator it;
int () {
    num = 0;
    aaa.clear();
    for (int i = 1; i < 105; i++)
        vv[i].clear();
    cin >> n;
    int tmp = INF;
    while (n--) {
        cin >> k >> s >> m;
        while (k--) {
            cin >> s;
            if (!aaa[s])
                aaa[s] = m, vv[m].push_back(s);
            else if (aaa[s] > m){
                for(it=vv[aaa[s]].begin();it!=vv[aaa[s]].end();)
                    if(*it==s) it=vv[aaa[s]].erase(it);
                    else it++;
                vv[m].push_back(s);
                aaa[s] = m;
            }
        }
    }
    for (int i = 1; i < 105; i++){
        num+=vv[i].size();
        
        if (vv[i].size() == 1&&num==i)
        cout << i << " " << vv[i][0] << endl;
    }
    return 0;
}