제출 #621043

#제출 시각아이디문제언어결과실행 시간메모리
621043mannshah1211마라톤 경주 (COCI14_utrka)C++14
0 / 80
0 ms212 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[b[i]]){ cout << a[i]; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...