ccf 公共钥匙盒 基于JAVA实现

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

public class ccf_201709_2 {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int N = scanner.nextInt(), K = scanner.nextInt();
		scanner.nextLine();
		
		int []key = new int[N];
		for(int i=0;i<N;i++)
			key[i] = i+1;
		int [][]w_s_c = new int[K][3];
		int max = 0, min = 10001;
		for(int i=0;i<K;i++) {
			w_s_c[i][0] = scanner.nextInt();
			w_s_c[i][1] = scanner.nextInt();
			w_s_c[i][2] = w_s_c[i][1] + scanner.nextInt();
			if(max<w_s_c[i][2])
				max = w_s_c[i][2];
			if(min>w_s_c[i][1])
				min = w_s_c[i][1];
			scanner.nextLine();
		}
		for(int t=min;t<=max;t++) {
			ArrayList<Integer>list = new ArrayList<>();
			for(int i=0;i<K;i++) {
				if(w_s_c[i][2]==t)
					list.add(w_s_c[i][0]);
			}
			Collections.sort(list);
			for(Integer i:list) {
				for(int j=0;j<N;j++)
					if(key[j]==0) {
						key[j] = i;
						break;
					}
			}
				
			
			for(int i=0;i<K;i++) {
				if(w_s_c[i][1]==t) {
					for(int j=0;j<N;j++) {
						if(key[j]==w_s_c[i][0])
							key[j] = 0;
					}
				}
			}
			
			System.out.println(Arrays.toString(key));
						
		}
		
		for(int i=0;i<N;i++)
			if(i==N-1)
				System.out.println(key[i]);
			else
				System.out.print(key[i] + " ");
		
	}

}