oj.uz

Submission #682644

# Submission time Handle Problem Language Result Execution time Memory
682644 2023-01-16T16:31:46 Z as111 Karte (COCI18_karte) C++14
12 / 120
 208 ms 5504 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 2260 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 2260 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 2264 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 2272 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 2260 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 2260 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 2264 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 38 ms 2376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 70 ms 2372 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 4932 KB Output is correct
2 Correct 157 ms 5504 KB Output is correct