2020-08-22 18:28 中国地质大学（武汉） golang
关注
#美团笔试#
老哥们送外卖这个哪里错了，直接排序不行吗
public class Main {
static class Pay {
int vals;
int weight;
int id;
public Pay(int vals, int weight, int id) {
this.vals = vals;
this.weight = weight;
this.id = id;
}
int pay() {
return vals + weight * 2;
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), m = sc.nextInt();
Pay[] pays = new Pay[n];
for (int i = 0; i < n; i++) {
pays[i] = new Pay(sc.nextInt(), sc.nextInt(), i);
}
Arrays.sort(pays, (p1, p2) -> {
int t = p2.pay() - p1.pay();
if (t == 0) {
return p1.id - p2.id;
}
return t;
});
for (int i = 1; i < m; i++) {
System.out.println((pays[i].id + 1) + " ");
}
}
}
老哥们送外卖这个哪里错了，直接排序不行吗
public class Main {
static class Pay {
int vals;
int weight;
int id;
public Pay(int vals, int weight, int id) {
this.vals = vals;
this.weight = weight;
this.id = id;
}
int pay() {
return vals + weight * 2;
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), m = sc.nextInt();
Pay[] pays = new Pay[n];
for (int i = 0; i < n; i++) {
pays[i] = new Pay(sc.nextInt(), sc.nextInt(), i);
}
Arrays.sort(pays, (p1, p2) -> {
int t = p2.pay() - p1.pay();
if (t == 0) {
return p1.id - p2.id;
}
return t;
});
for (int i = 1; i < m; i++) {
System.out.println((pays[i].id + 1) + " ");
}
}
}
全部评论
上海银行可内推
上海银行_信息技术部_测试工程师
用剑指topK的方法，做到55，不知道漏了哪个情况
不过春节
成都信息工程大学 嵌入式工程师
我也是这样写的，很迷惑
相关推荐
查看2道真题和解析 点赞 评论 收藏
分享
点赞 评论 收藏
分享
