제출 #497697

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
497697		LouayFarah	Karte (COCI18_karte)	C++17	120 / 120	122 ms	17888 KiB

karte

#include "bits/stdc++.h"

using namespace std;

#define endl "\n"
#define ll long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second

const long long MOD = 1e9+7;
const long long INF = 1e18;

int nx[4] = {0, 0, -1, 1};
int ny[4] = {1, -1, 0, 0};


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);


    ll n, k;
    cin >> n >> k;

    vector<ll> arr(n, 0);
    for(int i = 0; i<n; i++)
    {
        cin >> arr[i];
    }

    sort(arr.begin(), arr.end());

    stack<ll> res;
    for(int i = n-k; i<n; i++)
    {
        res.push(arr[i]);
    }

    for(int i = 0; i<n-k; i++)
    {
        res.push(arr[i]);
    }

    vector<ll> v;
    while(!res.empty())
    {
        v.pb(res.top());
        res.pop();
    }

    ll f = 0;
    for(int i = n-1; i>=0; i--)
    {
        if(v[i]>f)
        {
            f++;
        }
    }

    if(f==k)
    {
        for(auto elt: v)
            cout << elt << ' ';
        cout << endl;
    }
    else
    {
        cout << -1 << endl;
    }

    return 0;
}

• 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