제출 #1253959

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1253959		kerem	Karte (COCI18_karte)	C++20	120 / 120	72 ms	18608 KiB

karte

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fr first
#define sc second
#define pb push_back
#define all(x) x.begin(),x.end()
#define sp << " " <<
#define inf 1e15
#define N 200000
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tuple<int,int,int> tiii;
typedef pair<int,int> pii;

void solve(){
	int n,k;
	cin >> n >> k;
	int a[n];
	for(int i=0;i<n;i++)
		cin >> a[i];
	sort(a,a+n);
	vector<int> t,f;
	for(int i=0;i<n;i++){
		if(f.size()<a[i] || a[i]>k) f.pb(a[i]);
		else t.pb(a[i]);
	}
	int sz=f.size();
	if(sz<k || (sz>k && f[sz-k-1]>k)){
		cout << -1 << endl;
		return;
	}
	vector<int> ans;
	for(int i=0;i<sz;i++)
		ans.pb(f[(sz-k+i)%sz]);
	for(auto i:t) ans.pb(i);
	reverse(all(ans));
	for(auto i:ans)
		cout << i << " ";
	cout << endl;
}
int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);cout.tie(NULL);
	
	int test=1;
	//~ cin >> test;
	while(test--) solve();
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 12 / 12
• Subtask 6: 12 / 12
• Subtask 7: 12 / 12
• Subtask 8: 12 / 12
• Subtask 9: 12 / 12
• Subtask 10: 12 / 12