题解 | #查找学生信息#

测试用例和示例格式上略有出入

#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include "unordered_map"
using namespace std;
int main() {
    int N;
    while (cin >> N) { // 注意 while 处理多个 case
        // cout << a + b << endl;
        unordered_map <int, string> myMap;
        
        while (N--) {
            int num;
            cin>>num;
            string student;
            getline(cin, student);
            myMap.insert(make_pair(num,student));
        }
        int M;
        cin >> M;
        while (M--) {
            int num;
            cin >> num;
            if (myMap.find(num) == myMap.end())
                cout << "No Answer!" << endl;
            else {

                cout << num << myMap.find(num)->second<<endl ;
            }

        }
    }
}
// 64 位输出请用 printf("%lld")