Submission #736648

#	Time	Username	Problem	Language	Result	Execution time	Memory
736648		JellyTheOctopus	Karte (COCI18_karte)	C++17	120 / 120	197 ms	7748 KiB

karte

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

int N, K;
vector<int> arr;

bool check() {
	int numFalse = 0;
	for (int i = 0; i < N; i++) {
		if (arr[i] > numFalse) {
			numFalse++;
		}
	}
	if (numFalse == K) {
		return true;
	}
	return false;
}

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

• 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: 12 / 12
• Subtask 9: 12 / 12
• Subtask 10: 12 / 12