#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
typedef pair <int, int> pii;
typedef long long ll;
const int inf = 1e9 + 1;
const double eps = 1e-9;
const int MAXN = 1e5 + 1;
int n;
map <string, int> m;
string ime;
int main(){
cin >> n;
for (int i = 0; i < n; i++){
cin >> ime;
m[ime]++;
}
for (int i = 1; i < n; i++){
cin >> ime;
m[ime]--;
}
for (map<string,int>::iterator it = m.begin(); it != m.end(); it++){
if (it->second == 1){
cout << it->first;
return 0;
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
3 ms |
416 KB |
Output is correct |
4 |
Correct |
4 ms |
572 KB |
Output is correct |
5 |
Correct |
6 ms |
572 KB |
Output is correct |
6 |
Correct |
136 ms |
5676 KB |
Output is correct |
7 |
Correct |
216 ms |
9280 KB |
Output is correct |
8 |
Correct |
289 ms |
12708 KB |
Output is correct |
9 |
Correct |
315 ms |
15692 KB |
Output is correct |
10 |
Correct |
325 ms |
17980 KB |
Output is correct |