제출 #734611

#제출 시각아이디문제언어결과실행 시간메모리
734611JellyTheOctopusKarte (COCI18_karte)C++17
12 / 120
197 ms4808 KiB
#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();
		for (int i = N-1; i >= 0; i--) {
			cout << arr[i] << " ";
		} cout << "\n";
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...