#include<iostream>
#include<string>
#include<unordered_set>
using namespace std;
unordered_multiset<string> S;
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
string str;
cin>>str;
S.insert(str);
}
for(int i=1;i<=n-1;i++)
{
string str;
cin>>str;
S.erase(S.find(str));
}
cout<<*S.begin();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1724 KB |
Output is correct |
2 |
Correct |
0 ms |
1724 KB |
Output is correct |
3 |
Correct |
1 ms |
1724 KB |
Output is correct |
4 |
Correct |
2 ms |
1724 KB |
Output is correct |
5 |
Correct |
0 ms |
1724 KB |
Output is correct |
6 |
Correct |
128 ms |
6636 KB |
Output is correct |
7 |
Correct |
189 ms |
9380 KB |
Output is correct |
8 |
Correct |
236 ms |
10964 KB |
Output is correct |
9 |
Correct |
266 ms |
11752 KB |
Output is correct |
10 |
Correct |
257 ms |
11756 KB |
Output is correct |