Ignatius and the Princess IV
借此机会,学习了一下java中的map类
import java.util.*;
import java.math.*;
import java.io.*;
public class Main {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
while(cin.hasNext()){
int n = cin.nextInt();
Map<Integer, Integer>mp = new HashMap<Integer, Integer>();
int[] a = new int[n];
for(int i = 0; i < n; i++) {
a[i] = cin.nextInt();
}
int maxx = 0;
int ans = 0;
for(int i = 0; i < n; i++) {
if(mp.containsKey(a[i])) {
int cnt = mp.get(a[i]) + 1;
mp.put(a[i], cnt);
if(cnt >= (n+1)/2) {
ans = a[i];
}
}
else {
mp.put(a[i], 1);
}
}
System.out.println(ans);
}
}
}