제출 #649860

#제출 시각아이디문제언어결과실행 시간메모리
649860inksamuraiKarte (COCI18_karte)C++17
120 / 120
121 ms5392 KiB
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3yqVz8E ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e

signed main(){
_3yqVz8E;
	int n,k;
	cin>>n>>k;
	vi a(n);
	rep(i,n){
		cin>>a[i];
	}
	sort(a.begin(),a.end());
	vi b;
	per(i,k){
		b.pb(a.back());
		a.pop_back();
	}
	for(auto v:b){
		a.pb(v);
	}
	int now=0;
	per(i,n){
		if(now>=a[i]){

		}else{
			now+=1;
		}
	}
	if(now!=k){
		cout<<"-1\n";
	}else{
		for(auto v:a)cout<<v<<" ";
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...