题目链接
https://www.patest.cn/contests/gplt/L1-005
题意 有一个 考生号，一个试机座位，一个考试座位，给出试机座位，查询 考生号和考试座位
思路 MAP + 结构体
AC代码
#include <iostream> #include <cstdio> #include <algorithm> #include <cmath> #include <deque> #include <vector> #include <queue> #include <string> #include <cstring> #include <map> #include <stack> #include <set> #include <cstdlib> #include <ctype.h> #include <numeric> #include <sstream> using namespace std; typedef long long LL; const double PI = 3.14159265358979323846264338327; const double E = 2.718281828459; const double eps = 1e-6; const int MAXN = 0x3f3f3f3f; const int MINN = 0xc0c0c0c0; const int maxn = 1e5 + 5; const int MOD = 1e9 + 7; struct node { int num; string ID; }temp; int main() { int n; int i; int vis; map <int, node> m; m.clear(); cin >> n; for (i = 0; i < n; i++) { cin >> temp.ID; scanf("%d%d", &vis, &temp.num); m[vis] = temp; } cin >> n; for (i = 0; i < n; i++) { scanf("%d", &vis); cout << m[vis].ID << " " << m[vis].num << endl; } }转载于:https://www.cnblogs.com/Dup4/p/9433350.html
