제출 #94196

#제출 시각아이디문제언어결과실행 시간메모리
94196teomrnKarte (COCI18_karte)C++14
120 / 120
118 ms7776 KiB
#include <bits/stdc++.h>
using namespace std;

int main()
{
	int n, k;
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> k;

	int good = n - k;
	
	vector <int> v(n);
	for (auto & i : v)
		cin >> i;

	sort(v.begin(), v.end());
	reverse(v.begin() + good, v.end());

	int ansact = 0;
	for (int i = n - 1; i >= 0; i--)
		if (v[i] > ansact)
			ansact++;

	if (ansact != k)
		return cout << "-1\n", 0;

	for (auto i : v)
		cout << i << ' ';

	cout << '\n';

	return 0;
}



#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...