Submission #4018941

Source Code Expand

N=int(input())
l = []
ans = [1]
for i in range(N):
    l.append(input())
l.sort()
for v in range(N-1):
    if l[v+1]==l[v]:
        ans[-1]+=1
    else:
        ans.append(1)
print(l[max(ans)-1])

Submission Info

Submission Time
Task B - 投票
User issan
Language Python (3.4.3)
Score 0
Code Size 206 Byte
Status WA
Exec Time 17 ms
Memory 3060 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 2
WA × 1
AC × 11
WA × 7
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, case_06.txt, case_07.txt, case_08.txt, case_09.txt, case_10.txt, case_11.txt, case_12.txt, case_13.txt, case_14.txt, case_15.txt
Case Name Status Exec Time Memory
case_01.txt AC 17 ms 3060 KB
case_02.txt AC 17 ms 2940 KB
case_03.txt WA 17 ms 2940 KB
case_04.txt AC 17 ms 3060 KB
case_05.txt AC 17 ms 3060 KB
case_06.txt AC 17 ms 3060 KB
case_07.txt WA 17 ms 3060 KB
case_08.txt WA 17 ms 3060 KB
case_09.txt WA 17 ms 2940 KB
case_10.txt AC 17 ms 3060 KB
case_11.txt AC 17 ms 3060 KB
case_12.txt AC 17 ms 2940 KB
case_13.txt AC 17 ms 3060 KB
case_14.txt WA 17 ms 2940 KB
case_15.txt WA 17 ms 2940 KB
sample_01.txt WA 17 ms 2940 KB
sample_02.txt AC 17 ms 2940 KB
sample_03.txt AC 17 ms 2940 KB