# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
383324 | Iwanttobreakfree | Utrka (COCI14_utrka) | C++17 | 374 ms | 10496 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 <iostream>
#include <map>
using namespace std;
int main(){
int n;
string str;
cin>>n;
map<string,int> m;
for(int i=0;i<n;i++){
cin>>str;
if(m.find(str)==m.end()){
m.insert(make_pair(str,1));
}
else m[str]++;
}
for(int i=0;i<n-1;i++){
cin>>str;
m[str]--;
if(m[str]==0)m.erase(str);
}
for(auto it=m.begin();it!=m.end();it++){
cout<<it->first;
break;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |