题解 | 分数线划定
分数线划定
https://www.nowcoder.com/practice/2395fa7b6c6e452e8d8310a7cfdbe902
import java.util.*;
import java.util.stream.Collectors;
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String s = in.nextLine();
String[] s1 = s.split(" ");
//报名人数与计划录取人数
int a = Integer.valueOf(s1[0]);
int b = Integer.valueOf(s1[0]);
//面试名额
double c = Integer.valueOf(s1[1]) * 1.5;
int d = (int) c;
TreeMap<String, Integer> stringIntegerTreeMap = new TreeMap<>();
for (int i = 0; i < a; i++) {
String i1 = in.next();
int i2 = in.nextInt();
stringIntegerTreeMap.put(i1, i2);
}
Map<String, Integer> collect = stringIntegerTreeMap.entrySet().stream().sorted(Map.Entry.<String, Integer>comparingByValue().reversed().thenComparing(Map.Entry.comparingByKey())).collect(Collectors.toMap(Map.Entry::getKey, Map.Entry::getValue,(v1,v2)->v2, LinkedHashMap::new));
int score=0;
int count=1;
for (Map.Entry<String, Integer> stringIntegerEntry : collect.entrySet()) {
if (count==d){
score=stringIntegerEntry.getValue();
break;
}
count++;
}
int finalScore = score;
long totalcount = collect.entrySet().stream().filter(e -> e.getValue() >= finalScore).count();
System.out.println(finalScore+" "+totalcount);
collect.entrySet().stream().filter(e->e.getValue()>= finalScore).forEach(e-> System.out.println(e.getKey()+" "+e.getValue()));
}
}
SHEIN希音公司福利 356人发布