# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
713562 |
2023-03-22T13:29:27 Z |
ALTAKEXE |
Utrka (COCI14_utrka) |
C++14 |
|
129 ms |
8832 KB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
string a[100000], b[100000];
cin>>n;
for(int i = 0; i < n; i++) cin>>a[i];
for(int i = 0; i < n - 1; i++) cin>>b[i];
sort(a, a + n);
sort(b, b + n - 1);
for(int i = 0; i < n; i++)
if(a[i] != b[i])
{
cout<<a[i]<<endl;
return 0;
}
cout<<a[n-1];
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
6484 KB |
Output is correct |
2 |
Correct |
4 ms |
6484 KB |
Output is correct |
3 |
Correct |
4 ms |
6484 KB |
Output is correct |
4 |
Correct |
5 ms |
6484 KB |
Output is correct |
5 |
Correct |
5 ms |
6484 KB |
Output is correct |
6 |
Correct |
62 ms |
7692 KB |
Output is correct |
7 |
Correct |
93 ms |
8252 KB |
Output is correct |
8 |
Correct |
118 ms |
8620 KB |
Output is correct |
9 |
Correct |
129 ms |
8832 KB |
Output is correct |
10 |
Correct |
125 ms |
8776 KB |
Output is correct |