Submission #729995

#	Time	Username	Problem	Language	Result	Execution time	Memory
729995		rahulverma	Karte (COCI18_karte)	Java	12 / 120	1065 ms	35364 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(og);
		Arrays.sort(arr);
		Integer[] arr2 = new Integer[n - k];
		for(int i = 0; i < n - k; i++) {
			arr2[i] = og[i];
		}
		Arrays.sort(arr2);
		
		int falses = 0;
		for(int i = 0; i < n; i++) {
			if(i < k) {
				if(falses < arr[i]) {
					falses++;
				}
			}
			else {
				if(falses < arr2[i - k]) {
					falses++;
				}
			}
		}
		if(falses == k) {
			for(int v: arr) System.out.print(v + " ");
			for(int v: arr2) System.out.print(v + " ");
		}
		else {
			System.out.println(-1);
		}
		
	}

}

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