이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
int n,k;
cin>>n>>k;
int a[n];
for (int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
multiset<int> se;
for (int i=n-1;i>n-1-k;i--)
se.insert(a[i]);
int cnt[k+1]={};
for (int i=0;i<n-k;i++)
{
if (a[i]>k)
return cout<<-1<<endl, 0;
cnt[a[i]]++;
}
vector<int> ans;
for (int i=0;i<=k;i++)
{
while (cnt[i]--)
ans.push_back(i);
if (i<k)
{
auto x=se.begin();
if (*x<=i)
{
cout<<-1<<endl;
return 0;
}
ans.push_back(*x);
se.erase(x);
}
}
for (int i:ans)
cout<<i<<' ';
cout<<endl;
return 0;
}
# | 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... |