# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
95289 |
2019-01-29T17:07:05 Z |
MatesV13 |
Utrka (COCI14_utrka) |
C++11 |
|
189 ms |
11256 KB |
#include <bits/stdc++.h>
using namespace std;
string c;
int n;
multiset<string> s;
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i=0;i<n;i++){
cin >> c;
s.insert(c);
}
for (int i=1;i<n;i++){
cin >> c;
s.erase(s.find(c));
}
multiset<string>::iterator it=s.begin();
cout << *it;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
380 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
3 ms |
420 KB |
Output is correct |
5 |
Correct |
3 ms |
376 KB |
Output is correct |
6 |
Correct |
70 ms |
5792 KB |
Output is correct |
7 |
Correct |
120 ms |
8580 KB |
Output is correct |
8 |
Correct |
168 ms |
10320 KB |
Output is correct |
9 |
Correct |
187 ms |
11256 KB |
Output is correct |
10 |
Correct |
189 ms |
11256 KB |
Output is correct |