이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
int64_t n, k, a[100000+1], temp = 0;
vector<int64_t> ans;
bool possible = true;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for(int64_t i=0; i<n; i++) {
cin >> a[i];
}
sort(a,a+n);
for(int64_t i=n-k; i<n; i++) {
ans.push_back(a[i]);
}
for(int64_t i=0; i<n-k; i++) {
ans.push_back(a[i]);
}
for(int64_t i=0; i<n; i++) {
if(i < k) {
if(ans[i] <= temp) {
possible = false;
// break;
}
temp++;
}
else if(ans[i] > k) {
possible = false;
// break;
}
}
if(!possible) cout << "-1\n";
else {
reverse(ans.begin(), ans.end());
for(auto i : ans) {
cout << i << " ";
}
cout << '\n';
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |