제출 #210787

#제출 시각아이디문제언어결과실행 시간메모리
210787tleontest1마라톤 경주 (COCI14_utrka)C++14
80 / 80
225 ms27256 KiB

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t;
int cev;
string s[li];
map<string,int> mpp;
vector<int> v;

int main(void){
	fio();
	cin>>n;
	FOR cin>>s[i];
	for(int i=1;i<n;i++){
		string ss;
		cin>>ss;
		mpp[ss]++;
	}
	FOR{
		if(mpp[s[i]]==0){cout<<s[i]<<endl;return 0;}
		mpp[s[i]]--;
	}
	return 0;
}

#Verdict Execution timeMemoryGrader output
Fetching results...