# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103499 | leonarda | Utrka (COCI14_utrka) | C++14 | 145 ms | 13952 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<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define first ff
#define second ss
typedef pair<int, int> pi;
typedef long long int lint;
const int inf = 0x3f3f3f3f;
int n;
vector <string> v1, v2;
int main ()
{
ios::sync_with_stdio(0);
cin >> n;
for(int i = 0; i < n; ++i) {
string s;
cin >> s;
v1.pb(s);
}
for(int i = 0; i < n - 1; ++i) {
string s;
cin >> s;
v2.pb(s);
}
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
for(int i = 0; i < v2.size(); ++i)
if(v1[i] != v2[i]) {
cout << v1[i];
return 0;
}
cout << v1[n - 1];
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |