#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ITER iterator
using namespace std;
typedef long long lint;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef set<int> si;
const int inf = 0x3f3f3f3f;
const int maxn = 0;
const int MOD = 1e9 + 7;
int n;
map<string, int> m;
int main ()
{
ios::sync_with_stdio(NULL);
cin.tie(0); cout.tie(0);
cin >> n;
for(int i = 0; i < n; ++i) {
string ime;
cin >> ime;
++m[ime];
}
for(int i = 0; i < n - 1; ++i) {
string ime;
cin >> ime;
--m[ime];
}
for(map<string, int>::ITER it = m.begin(); it != m.end(); ++it) {
if(it -> S != 0) {
cout << it -> F;
break;
}
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
3 ms |
376 KB |
Output is correct |
4 |
Correct |
3 ms |
376 KB |
Output is correct |
5 |
Correct |
3 ms |
504 KB |
Output is correct |
6 |
Correct |
93 ms |
5624 KB |
Output is correct |
7 |
Correct |
140 ms |
7932 KB |
Output is correct |
8 |
Correct |
199 ms |
9580 KB |
Output is correct |
9 |
Correct |
202 ms |
10404 KB |
Output is correct |
10 |
Correct |
205 ms |
10488 KB |
Output is correct |