package Algorithm;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
class Member implements Comparable {
int num, w, d, c;
@Override
public int compareTo(Object o) {
Member t = (Member)o;
return this.w == t.w ? this.num - t.num : t.w - this.w;
}
}
public class Department1 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt(), k = scan.nextInt();
int[] e = new int[10];
for(int i = 0; i < 10; i++) e[i] = scan.nextInt();
ArrayList<Member> li = new ArrayList<>();
for(int i = 0; i < n; i++) {
Member t = new Member();
t.num = i+1; t.w = scan.nextInt();
t.d = 0; t.c = 0;
li.add(t);
}
Collections.sort(li);
for(int i = 0; i < li.size(); i++) {
li.get(i).d = i + 1;
li.get(i).c = i % 10 + 1;
li.get(i).w += e[li.get(i).c-1];
}
Collections.sort(li);
for(int i = 0; i < k; i++) {
System.out.print(li.get(i).num);
if(i + 1 != k) {
System.out.print(" ");
}
}
}
}
原文:https://www.cnblogs.com/fromneptune/p/12335952.html