Submission #729999

#	Time	Username	Problem	Language	Result	Execution time	Memory
729999		rahulverma	Karte (COCI18_karte)	Java	84 / 120	1075 ms	26796 KiB

karte

import java.io.*;
import java.util.*;

public class karte {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		Integer[] cards = new Integer[n];
		for(int i = 0; i < n; i++) cards[i] = Integer.parseInt(br.readLine());
		Arrays.sort(cards, Collections.reverseOrder());
		Arrays.sort(cards, 0, k);
		
		
		int falses = 0;
		for(int i = 0; i < n; i++) {
			if(falses < cards[i]) falses++;
		}
		
		PrintWriter pw = new PrintWriter(System.out);
		
		if(falses == k) {
			for(int i = n - 1; i >= 0; i--) pw.print(cards[i] + " ");
		}
		else {
			pw.println(-1);
		}
		pw.close();
		
	}

}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 12 / 12
• Subtask 6: 12 / 12
• Subtask 7: 12 / 12
• Subtask 8: 0 / 12
• Subtask 9: 0 / 12
• Subtask 10: 0 / 12