#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
//const int N = 10e5+5;
//int arr[N][N];
int main()
{
lli n, i;
string name;
cin>>n;
multiset<string> list;
for(i=0;i<n;i++)
{
cin>>name;
list.insert(name);
}
for(i=0;i<n-1;i++)
{
cin>>name;
auto it=list.find(name);
list.erase(it);
}
auto it=list.begin();
cout<<*it;
//freopen("diamond.in","r",stdin);
//freopen("diamond.out","w",stdout);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
304 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
308 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
70 ms |
5600 KB |
Output is correct |
7 |
Correct |
115 ms |
8352 KB |
Output is correct |
8 |
Correct |
173 ms |
10388 KB |
Output is correct |
9 |
Correct |
168 ms |
11080 KB |
Output is correct |
10 |
Correct |
177 ms |
11144 KB |
Output is correct |