Submission #16825

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
16825	2015-10-02T04:31:47 Z	cki86201	Utrka (COCI14_utrka)	C++	80 / 80	444 ms	12812 KB

utrka

#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;
}

Subtask #1

80.0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	1724 KB	Output is correct
2	Correct	0 ms	1724 KB	Output is correct
3	Correct	2 ms	1724 KB	Output is correct
4	Correct	2 ms	1724 KB	Output is correct
5	Correct	3 ms	1724 KB	Output is correct
6	Correct	215 ms	7268 KB	Output is correct
7	Correct	347 ms	9908 KB	Output is correct
8	Correct	401 ms	11756 KB	Output is correct
9	Correct	444 ms	12812 KB	Output is correct
10	Correct	443 ms	12812 KB	Output is correct