oj.uz

답안 #824087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824087 2023-08-13T13:33:33 Z ajay 마라톤 경주 (COCI14_utrka) C++14
80 / 80
 92 ms 10340 KB 
/* Ajay Jadhav */

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;

#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define endl '\n'

void solve()
{
    int n;
    cin >> n;
    map<string, int> winners;
    rep(i, 0, n)
    {
        string s;
        cin >> s;
        winners[s]++;
    }

    rep(i, 0, n - 1)
    {
        string s;
        cin >> s;
        winners[s]--;
    }
    for (auto it : winners)
    {
        if (it.second > 0)
        {
            cout << it.first << endl;
        }
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin>>t;
    while (t--)
    {
        solve();
    }
    return 0;
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 42 ms 5324 KB Output is correct
7 Correct 65 ms 7720 KB Output is correct
8 Correct 81 ms 9492 KB Output is correct
9 Correct 92 ms 10312 KB Output is correct
10 Correct 91 ms 10340 KB Output is correct