# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
164400 | boolodifjenula | Utrka (COCI14_utrka) | Cpython 3 | 676 ms | 19872 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
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])
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |