Submission #621055

#TimeUsernameProblemLanguageResultExecution timeMemory
621055mannshah1211Utrka (COCI14_utrka)C++14
80 / 80
213 ms26980 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin >> n; string a[n]; unordered_map <string, int> freq2; for(int i = 0; i < n; i++){ cin >> a[i]; freq2[a[i]] = 0; } for(int i = 0; i < n; i++){ freq2[a[i]]++; } unordered_map <string, int> freq; string b[n - 1]; for(int i = 0; i < n - 1; i++){ cin >> b[i]; freq[b[i]] = 0; } for(int i = 0; i < n - 1; i++){ freq[b[i]]++; } for(int i = 0; i < n; i++){ if(freq2[a[i]] != freq[a[i]]){ cout << a[i]; break; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...