oj.uz

답안 #484608

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
484608 2021-11-04T17:42:50 Z asandikci 마라톤 경주 (COCI14_utrka) C++17
80 / 80
 121 ms 11108 KB 
/*
Aliberk Sandıkçı
3 November 2021
Current Rank: Newbie
Current Grade: 10th in Izmir Science High School

*/
 
#include "bits/stdc++.h"
#define pb push_back
#define lwb lower_bound
#define upb upper_bound
#define fi first
#define se second
#define debu cout << "*debug*\n"
#define debug(x) cout << "debug " << x <<"\n"
#define int long long
constexpr int modn = 1e9+7;		// 998244353
constexpr int maxn = 1e6+5;	
constexpr int INF = 1e9+5;	
using namespace std;
 
multiset<string> mts;

void solve(){
	int n;
	cin >> n;
	string str;
	for(int i=0;i<n;i++){
		cin >> str;
		mts.insert(str);
	}
	for(int i=0;i<n-1;i++){
		cin >> str;
		auto it = mts.find(str);
		if(it!=mts.end()){
			mts.erase(it);
		}
	}
	cout << *(mts.begin());


}
 
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);	
	//freopen("","r",stdin);
	//freopen("","w",stdout);	
 	
	int T=1;
	//cin >> T;	
	while(T--){
		solve();	
	}	
	return 0;
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 44 ms 5732 KB Output is correct
7 Correct 75 ms 8348 KB Output is correct
8 Correct 110 ms 10112 KB Output is correct
9 Correct 121 ms 11076 KB Output is correct
10 Correct 119 ms 11108 KB Output is correct