Submission #734602

#	Time	Username	Problem	Language	Result	Execution time	Memory
734602		JellyTheOctopus	Karte (COCI18_karte)	C++17	12 / 120	170 ms	5180 KiB

karte

#include <bits/stdc++.h>
using namespace std;

int N, K;
vector<int> arr;

int check() {
	int numLies = 0;
	for (int i = 0; i < N; i++) {
		if (numLies < arr[i]) {
			numLies++;
		}
	}
	return numLies;
}

int main() {
	cin >> N >> K;
	arr.resize(N);
	for (int i = 0; i < N; i++) {
		cin >> arr[i];
	}	
	sort(arr.begin(), arr.end(), greater<int>());
	int numLies = check();
	if (numLies > K) {
		cout << -1 << "\n";
	} 
	else {
		rotate(arr.begin(), arr.begin()+(K-numLies), arr.end());
		
		numLies = check();
		if (numLies != K) {
			cout << -1 << "\n";
		}
		else {
			for (int i = 0; i < N; i++) {
				cout << arr[i] << " ";
			} cout << "\n";
		}
	}
}

• 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