제출 #270678

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
270678		wutwere	Karte (COCI18_karte)	C++17	120 / 120	123 ms	10092 KiB

karte

#include <bits/stdc++.h>
using namespace std;
using ll=int64_t;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define _F(i,a,b,s) for(int i=(a);((s)>0?i<(b):i>(b));i+=(s))
#define _1(e) _F(i,0,e,1)
#define _2(i,e) _F(i,0,e,1)
#define _3(i,b,e) _F(i,b,e,(b)<(e)?1:-1)
#define _G(a,b,c,d,e,...) e
#define FOR(...) _G(__VA_ARGS__,_F,_3,_2,_1)(__VA_ARGS__)

int a[500000];

int main() {
	ios::sync_with_stdio(0),cin.tie(0);
	int n, k; cin >> n >> k;
	FOR (i, n) cin >> a[i];
	sort(a, a + n);
	vector<int> ans;
	FOR (i, k) {
		int ni = n - k + i;
		if (a[ni] >= i + 1) {
			ans.pb(a[ni]);
		} else {
			cout << "-1\n";
			return 0;
		}
	}
	FOR (i, n - k) {
		if (a[i] <= k) {
			ans.pb(a[i]);
		} else {
			cout << "-1\n";
			return 0;
		}
	}
	FOR (i, n - 1, -1) cout << ans[i] << ' ';
}

• 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