Urkupillit

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

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

    long n, k;
    cin >> n >> k;

    vector<long> u;

    for (long i = n; i >= 1; i--) {
        if (u.size() == 0) {
            u.push_back(i);
            continue;
        }

        long j = min(k, static_cast<long>(u.size()));

        k -= j;
        if (j < static_cast<int>(u.size())) {
            u.insert(u.begin() + j, i);
        } else {
            u.push_back(i);
        }
    }

    for (long i = 0; i < n; i++) {
        cout << u[i];
        if (i != n - 1) {
            cout << " ";
        }
    }

    cout << "\n";

    return 0;
}

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: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED