Submission #169345
Source Code Expand
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N=sc.nextInt(); String names[] = new String[N]; int cnts[] = new int [N]; int max=0; for(int i=0;i<names.length;i++){ names[i]=sc.next(); } for(int i=0;i<names.length;i++){ for(int j=0;j<names.length;j++){ if(names[i].equals(names[j])){ cnts[i]++; } } } for(int i=0;i<names.length;i++){ if(max<cnts[i]){ max=i; } } System.out.println(names[max]); } }
Submission Info
Submission Time | |
---|---|
Task | B - 投票 |
User | melon3 |
Language | Java (OpenJDK 1.7.0) |
Score | 100 |
Code Size | 585 Byte |
Status | AC |
Exec Time | 510 ms |
Memory | 23500 KB |
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 | 510 ms | 23116 KB |
case_02.txt | AC | 461 ms | 23216 KB |
case_03.txt | AC | 466 ms | 23224 KB |
case_04.txt | AC | 468 ms | 23340 KB |
case_05.txt | AC | 472 ms | 23220 KB |
case_06.txt | AC | 485 ms | 23500 KB |
case_07.txt | AC | 484 ms | 23248 KB |
case_08.txt | AC | 478 ms | 23216 KB |
case_09.txt | AC | 488 ms | 23088 KB |
case_10.txt | AC | 496 ms | 23088 KB |
case_11.txt | AC | 470 ms | 23136 KB |
case_12.txt | AC | 463 ms | 23216 KB |
case_13.txt | AC | 493 ms | 23348 KB |
case_14.txt | AC | 493 ms | 23172 KB |
case_15.txt | AC | 478 ms | 23180 KB |
sample_01.txt | AC | 475 ms | 23092 KB |
sample_02.txt | AC | 479 ms | 23216 KB |
sample_03.txt | AC | 476 ms | 23092 KB |