# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
686662 |
2023-01-25T17:36:20 Z |
mdub |
Utrka (COCI14_utrka) |
C++14 |
|
157 ms |
10284 KB |
#include <bits/stdc++.h>
using namespace std;
int main () {
map<string, int> contestants;
int n; cin >> n;
for (int i = 0; i < n; i++) {
string s; cin >> s;
contestants[s]++;
}
for (int i = 0; i < n - 1; i++) {
string s; cin >> s;
contestants[s]--;
}
for (pair<string, int> elem: contestants) {
if (elem.second > 0) cout << elem.first << '\n';
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
2 ms |
316 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
6 |
Correct |
79 ms |
5416 KB |
Output is correct |
7 |
Correct |
119 ms |
7756 KB |
Output is correct |
8 |
Correct |
157 ms |
9472 KB |
Output is correct |
9 |
Correct |
157 ms |
10284 KB |
Output is correct |
10 |
Correct |
156 ms |
10284 KB |
Output is correct |