Urkupillit

#include <bits/stdc++.h>

using namespace std;

typedef long long int ll;

int n;
ll k;
set<ll> s;

int main()
{
    cin>>n>>k;

    for(ll i=0;i<n;i++)
    {
        s.insert(i+1);
    }

    ll last = *s.rbegin();
    while(k>=last-1 && k>0)
    {
        k -= last-1;
        cout<<last<<' ';
        s.erase(last);
        last = (s.size() == 0 ? 1e9 : *s.rbegin());
    }

    if(k>0)
    {
        s.erase(k+1);
        cout<<k+1<<' ';
    }

    for(ll val : s)
    {
        cout<<val<<' ';
    }
}

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