-
Notifications
You must be signed in to change notification settings - Fork 34
/
Copy pathA.java
46 lines (40 loc) · 1.27 KB
/
A.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
import java.io.PrintStream;
import java.util.*;
/**
* APAC 2017 Round A Problem A: Country Leader
* Check README.md for explanation.
*/
public class Main {
class Node {
String s;
int different;
public Node(String _s) {
s=_s;
boolean[] chars=new boolean[26];
different=0;
for (char c: s.toCharArray()) {
if (c!=' ' && !chars[c-'A']) {
different++;
chars[c-'A']=true;
}
}
}
}
private String solve(Scanner scanner) {
int n=scanner.nextInt(); scanner.nextLine();
PriorityQueue<Node> queue=new PriorityQueue<>(
(o1,o2)->o1.different==o2.different?o1.s.compareTo(o2.s):o2.different-o1.different);
for (int i=0;i<n;i++) {
queue.offer(new Node(scanner.nextLine()));
}
return queue.peek().s;
}
public static void main(String[] args) throws Exception {
System.setOut(new PrintStream("E:\\desktop\\output.txt"));
Scanner scanner=new Scanner(System.in);
int times=scanner.nextInt();
for (int t=1;t<=times;t++) {
System.out.println(String.format("Case #%d: %s", t, new Main().solve(scanner)));
}
}
}