Submission #94196

# Submission time Handle Problem Language Result Execution time Memory
94196 2019-01-16T15:01:34 Z teomrn Karte (COCI18_karte) C++14
120 / 120
118 ms 7776 KB
#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 time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 292 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 424 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 23 ms 1784 KB Output is correct
2 Correct 17 ms 1272 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 51 ms 3344 KB Output is correct
2 Correct 32 ms 2344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 118 ms 7776 KB Output is correct
2 Correct 71 ms 5240 KB Output is correct