oj.uz

Submission #164400

# Submission time Handle Problem Language Result Execution time Memory
164400 2019-11-20T11:37:39 Z boolodifjenula Utrka (COCI14_utrka) Python 3
80 / 80
 676 ms 19872 KB 
n=int(input())
L=[]
L1=[]
for i in range (n):
    L+=[input()]
for i in range (n-1):
    L1+=[input()]
L.sort()
L1.sort()
x=0
for i in range(n-1):
    if L[i]!=L1[i]:
        x=L[i]
        break
if x: print(x)
else: print(L[-1])

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 3428 KB Output is correct
2 Correct 26 ms 3272 KB Output is correct
3 Correct 29 ms 3392 KB Output is correct
4 Correct 30 ms 3516 KB Output is correct
5 Correct 31 ms 3456 KB Output is correct
6 Correct 321 ms 11656 KB Output is correct
7 Correct 514 ms 15580 KB Output is correct
8 Correct 620 ms 18276 KB Output is correct
9 Correct 676 ms 19872 KB Output is correct
10 Correct 669 ms 19696 KB Output is correct