Urkupillit

#include <iostream>
typedef long long ll;
using namespace std;
const ll MN = 1e5+100;
ll t[MN];

int main() {
    for(ll i = 0; i < MN; ++i) t[i] = -1;
    ll n,k;
    cin>>n>>k;
    for(ll i = 1; i <= n; ++i) {
        if(n - i <= k) {
            t[n-i] = i;
            k -= n - i;
        }
        else {
            t[k] = i;
            ll lol = i+1;
            for(ll j = 0; j < k; ++j) {
                t[j] = lol;
                //cout<<j<<' '<<lol<<'\n';
                ++lol;
            }
            for(ll j = 0; lol <= n; ++j) {
                t[k+j+1] = lol;
                //cout<<k+j<<' '<<lol<<'\n';
                ++lol;
            }
            break;
        }
    }
    for(ll i = 0; i < n; ++i) {
        cout<<t[i]<<' ';
    }
    cout<<'\n';
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED