제출 #16825

#제출 시각아이디문제언어결과실행 시간메모리
16825cki86201마라톤 경주 (COCI14_utrka)C++98
80 / 80
444 ms12812 KiB
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <memory.h> #include <math.h> #include <assert.h> #include <stack> #include <queue> #include <map> #include <set> #include <string> #include <algorithm> #include <iostream> using namespace std; typedef long long ll; typedef pair<int, int> Pi; #define Fi first #define Se second #define pb(x) push_back(x) #define sz(x) (int)x.size() map <string,int> M; int main(){ int n; scanf("%d",&n); for(int i=0;i<n;i++){ string s; cin >> s; M[s]++; } for(int i=0;i<n-1;i++){ string s; cin >> s; if(M[s] == 1)M.erase(s); else M[s]--; } cout << M.begin()->Fi; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...