# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
624816 |
2022-08-08T19:09:08 Z |
rm1729 |
Utrka (COCI14_utrka) |
C++14 |
|
132 ms |
8892 KB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
int n; cin >>n;
vector <string> names(n);
for(int i=0; i<n; i++){
string s;
cin >>s;
names[i]=s;
}
sort(names.begin(),names.end());
vector <string> ans(n-1);
for(int i=0; i<n-1; i++){
string s;
cin >>s;
ans[i]=s;
}
sort(ans.begin(),ans.end());
bool flag = false;
for(int i=0; i<n-1; i++){
if(names[i]!=ans[i]){
cout <<names[i]<<endl;
flag = true;
break;
}
}
if(!flag) cout <<names[n-1];
}
signed main(){
int t=1;// cin >>t;
while(t--){
solve();
}
return 0;
}
# |
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 |
2 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
6 |
Correct |
61 ms |
4540 KB |
Output is correct |
7 |
Correct |
97 ms |
6644 KB |
Output is correct |
8 |
Correct |
115 ms |
8052 KB |
Output is correct |
9 |
Correct |
129 ms |
8828 KB |
Output is correct |
10 |
Correct |
132 ms |
8892 KB |
Output is correct |