Submission #682644

#	Time	Username	Problem	Language	Result	Execution time	Memory
682644		as111	Karte (COCI18_karte)	C++14	12 / 120	208 ms	5504 KiB

karte

#include <iostream>
#include <vector>
#include <algorithm>

#define MAXN 500000

using namespace std;
int N, K;
vector<int> cards(MAXN);
vector<int> temp;
int main() {
	cin >> N >> K;
	for (int i = 0; i < N; i++) {
		cin >> cards[i];
	}
	sort(cards.begin(), cards.end());
	for (int i = K; i > 0;i--) { // first K greatest cards need to be able to work
		temp.push_back(cards.back());
		cards.pop_back();
	}
	for (int c : temp) {
		cards.push_back(c);
	}
	int cnt = 0;
	for (int i = N - 1; i >= 0;i--) {
		if (cnt < cards[i]) {
			cnt++;
		}
	}
	if (cnt != K) {
		cout << -1;
	}
	else {
		for (int c : cards) cout << c << " ";
	}
}

• Subtask 1: 0 / 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: 12 / 12