蓝桥杯算法提高VIP-班级排名-题解（Java代码）

解题思路:

注意事项:

参考代码:

Scanner scanner = new Scanner(System.in);

Map<String, Integer> map = new HashMap<String, Integer>();

int N = scanner.nextInt();

String sc[]=new String[N];

for (int i = 0; i < N; i++) {

sc[i]=scanner.next();

}

int M = scanner.nextInt();

int dada=0;

for (int i = 0; i < M; i++) { dada = 0;String name = "";int sum = 0;

for (int j = 0; j < N; j++) {

sum = scanner.nextInt();

name = scanner.next();

map.put(name, sum);

if ("DaDa".equals(name)) {

dada = sum;

}

}

}

int count = 1;

for(String key:map.keySet()){

if (map.get(key)>dada) {

count++;

}

}System.out.println(count);