L1-005 考试座位号 分数 15

map存取数据

// 4'57"
#include <iostream>
#include <map>
using namespace std;
#define int long long
#define x first
#define y second
signed main()
{
    map<int,pair<int,int>> hash;
    int n;
    cin >> n;
    for(int i = 1; i <= n; ++ i)
    {
        int arr[3];
        cin >> arr[0] >> arr[1] >> arr[2];
        hash[arr[1]] = {arr[0], arr[2]};
    }
    int q;
    cin >> q;
    while(q --)
    {
        int tmp;
        cin >> tmp;
        cout << hash[tmp].x << " " << hash[tmp].y << endl;
    }
    return 0;
}