# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
103499 | 2019-03-30T20:17:20 Z | leonarda | 마라톤 경주 (COCI14_utrka) | C++14 | 145 ms | 13952 KB |
#include<bits/stdc++.h> using namespace std; #define pb push_back #define mp make_pair #define first ff #define second ss typedef pair<int, int> pi; typedef long long int lint; const int inf = 0x3f3f3f3f; int n; vector <string> v1, v2; int main () { ios::sync_with_stdio(0); cin >> n; for(int i = 0; i < n; ++i) { string s; cin >> s; v1.pb(s); } for(int i = 0; i < n - 1; ++i) { string s; cin >> s; v2.pb(s); } sort(v1.begin(), v1.end()); sort(v2.begin(), v2.end()); for(int i = 0; i < v2.size(); ++i) if(v1[i] != v2[i]) { cout << v1[i]; return 0; } cout << v1[n - 1]; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 496 KB | Output is correct |
2 | Correct | 2 ms | 384 KB | Output is correct |
3 | Correct | 2 ms | 384 KB | Output is correct |
4 | Correct | 3 ms | 512 KB | Output is correct |
5 | Correct | 3 ms | 512 KB | Output is correct |
6 | Correct | 62 ms | 7108 KB | Output is correct |
7 | Correct | 97 ms | 11408 KB | Output is correct |
8 | Correct | 117 ms | 12928 KB | Output is correct |
9 | Correct | 145 ms | 13952 KB | Output is correct |
10 | Correct | 131 ms | 13916 KB | Output is correct |