Submission #729997

#	Time	Username	Problem	Language	Result	Execution time	Memory
729997		rahulverma	Karte (COCI18_karte)	Java	84 / 120	1069 ms	32204 KiB

karte

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

public class karte {

	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int n = s.nextInt();
		int k = s.nextInt();
		Integer[] og = new Integer[n];
		for(int i = 0; i < n; i++) og[i] = s.nextInt();
		Arrays.sort(og, Collections.reverseOrder());
		Integer[] arr = new Integer[k];
		for(int i = 0; i < k; i++) {
			arr[i] = og[i];
		}
		Arrays.sort(arr);
		int[] cards = new int[n];
		for(int i = 0; i < n; i++) {
			if(i < k) cards[i] = arr[i];
			else cards[i] = og[i];
			
		}
		
		int falses = 0;
		for(int i = 0; i < n; i++) {
			if(falses < cards[i]) falses++;
		}
		if(falses == k) {
			for(int i = n - 1; i >= 0; i--) System.out.print(cards[i] + " ");
		}
		else {
			System.out.println(-1);
		}
		
	}

}

• 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