/*
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 |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
53 ms |
4512 KB |
Output is correct |
7 |
Correct |
62 ms |
6688 KB |
Output is correct |
8 |
Correct |
81 ms |
8140 KB |
Output is correct |
9 |
Correct |
88 ms |
8920 KB |
Output is correct |
10 |
Correct |
84 ms |
8908 KB |
Output is correct |