Urkupillit

#include <bits/stdc++.h>

#define ll long long

using namespace std;

bool u[(int)1e5 + 3];

int main(){


    int n, k;
    cin >> n >> k;
    vector<int> ans;
    int c = n; 

    for(int i = 0; i < n; ++i){
        while(c - 1 > k)c--;
        u[c] = 1; k -= c-1;
        ans.push_back(c--);
        if(c==0){
            for(int j = 1; j <= n; ++j)if(!u[j])ans.push_back(j);
            break;
        }
    }
    for(int x : ans)cout << x << " ";
    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: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: ACCEPTED