This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ar array
const int INF = 1e15;
const int MOD = 1e9+7;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, c; cin>>n>>c;
vector<int> a(n);
for (int &i : a) cin>>i;
sort(a.begin(), a.end());
vector<int> ans;
for (int i = 0; i < n-c; i++) {
ans.push_back(a[i]);
}
for (int i = n-1; i >= n-c; --i) {
ans.push_back(a[i]);
}
int liars = 0;
for (int i = n-1; i >= 0; --i) {
if (liars < ans[i]) liars++;
}
if (liars != c) {
cout<<-1<<"\n";
return 0;
}
for (int 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... |