oj.uz

Submission #702329

# Submission time Handle Problem Language Result Execution time Memory
702329 2023-02-23T14:50:39 Z delrey Utrka (COCI14_utrka) C++14
80 / 80
 127 ms 11128 KB 
#include <bits/stdc++.h>

using namespace std;

int n;
string a[100000], b[100000];

int main()
{
    cin>>n;
    for(int i = 0; i < n; i++)
        cin>>a[i];
    for(int i = 0; i < n - 1; i++)
        cin>>b[i];
    sort(a, a + n);
    sort(b, b + n - 1);
    for(int i = 0; i < n - 1; i++)
        if(a[i] != b[i])
        {
            cout<<a[i]<<endl;
            return 0;
        }
    cout<<a[n - 1]<<endl;
    return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 4 ms 6572 KB Output is correct
4 Correct 5 ms 6484 KB Output is correct
5 Correct 4 ms 6576 KB Output is correct
6 Correct 62 ms 8828 KB Output is correct
7 Correct 95 ms 9948 KB Output is correct
8 Correct 111 ms 10624 KB Output is correct
9 Correct 127 ms 11076 KB Output is correct
10 Correct 123 ms 11128 KB Output is correct