# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
755100 | Unforgettablepl | Utrka (COCI14_utrka) | C++17 | 88 ms | 8920 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.
/*
ID: samikgo1
TASK:
LANG: C++
*/
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef pair<ll,ll> pll;
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define f first
#define s second
//#define x first
//#define y second
const int INF = INT32_MAX;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// freopen("haybales.in","r",stdin);
// freopen("haybales.out","w",stdout);
ll n;cin>>n;
string names[n];
string names2[n-1];
for(string&i:names)cin>>i;
for(string&i:names2)cin>>i;
sort(names,names+n);
sort(names2,names2+n-1);
for (int i = 0; i < n - 1; i++) {
if(names[i]!=names2[i]){
cout << names[i];
return 0;
}
}
cout << names[n-1];
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |