# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
80603 | heon | Utrka (COCI14_utrka) | C++11 | 230 ms | 9248 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int n;
string in1[100005];
string in2[100005];
int main(){
scanf("%d", &n);
for (int i = 0; i < n; ++i) cin >> in1[i];
for (int i = 0; i < n - 1; ++i) cin >> in2[i];
sort(in1, in1 + n);
sort(in2, in2 + n - 1);
for (int i = 0; i < n - 1; ++i){
if (in1[i] == in2[i]) continue;
cout << in1[i] << endl;
return 0;
}
cout << in1[n - 1] << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |