Submission #3376196
Source Code Expand
var i,j,c,d,e,b,n,m,max:longint; a:array[1..10000] of string; t,k:string; begin readln(n); for i:=1 to n do readln(a[i]); for i:=1 to n-1 do for j:=i+1 to n do if a[i]>a[j] then begin t:=a[i];a[i]:=a[j];a[j]:=t;end; e:=1; for i:=2 to n do begin if a[i]=a[i-1] then inc(e) else begin if e>max then begin max:=e;k:=a[i-1];end; e:=1; end; end; if e>max then begin max:=e;k:=a[n];end; writeln(k); end.
Submission Info
Submission Time | |
---|---|
Task | B - 投票 |
User | luogu_bot2 |
Language | Pascal (FPC 2.6.2) |
Score | 100 |
Code Size | 403 Byte |
Status | AC |
Exec Time | 0 ms |
Memory | 256 KB |
Compile Error
/usr/bin/ld.bfd: warning: ./link.res contains output sections; did you forget -T?
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
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 | 0 ms | 256 KB |
case_02.txt | AC | 0 ms | 256 KB |
case_03.txt | AC | 0 ms | 256 KB |
case_04.txt | AC | 0 ms | 256 KB |
case_05.txt | AC | 0 ms | 256 KB |
case_06.txt | AC | 0 ms | 256 KB |
case_07.txt | AC | 0 ms | 256 KB |
case_08.txt | AC | 0 ms | 256 KB |
case_09.txt | AC | 0 ms | 256 KB |
case_10.txt | AC | 0 ms | 256 KB |
case_11.txt | AC | 0 ms | 256 KB |
case_12.txt | AC | 0 ms | 256 KB |
case_13.txt | AC | 0 ms | 256 KB |
case_14.txt | AC | 0 ms | 256 KB |
case_15.txt | AC | 0 ms | 256 KB |
sample_01.txt | AC | 0 ms | 256 KB |
sample_02.txt | AC | 0 ms | 256 KB |
sample_03.txt | AC | 0 ms | 256 KB |