Submission #1778746
Source Code Expand
import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int n = scanner.nextInt(); String[] str = new String[n]; for(int i = 0; i < n ; i++){ str[i] = scanner.next(); } Arrays.sort(str); int count = 0; int max = 0; String ans = str[0]; for(int i = 0; i < n-1; i++){ if(str[i].equals(str[i+1])){ count++; if(count > max){ ans = str[i]; } }else{ count = 0; } } System.out.println(ans); } }
Submission Info
Submission Time | |
---|---|
Task | B - 投票 |
User | unirita152 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 574 Byte |
Status | WA |
Exec Time | 107 ms |
Memory | 24916 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 100 ms | 19668 KB |
case_02.txt | AC | 100 ms | 22740 KB |
case_03.txt | AC | 102 ms | 21588 KB |
case_04.txt | AC | 101 ms | 19796 KB |
case_05.txt | AC | 102 ms | 21460 KB |
case_06.txt | WA | 105 ms | 21460 KB |
case_07.txt | AC | 105 ms | 20692 KB |
case_08.txt | WA | 101 ms | 18644 KB |
case_09.txt | AC | 101 ms | 24916 KB |
case_10.txt | AC | 102 ms | 21844 KB |
case_11.txt | AC | 106 ms | 21332 KB |
case_12.txt | WA | 103 ms | 21332 KB |
case_13.txt | AC | 104 ms | 19924 KB |
case_14.txt | AC | 102 ms | 19924 KB |
case_15.txt | AC | 107 ms | 23636 KB |
sample_01.txt | AC | 105 ms | 21844 KB |
sample_02.txt | AC | 106 ms | 19796 KB |
sample_03.txt | AC | 99 ms | 21076 KB |