Urkupillit

#include <bits/stdc++.h>

using namespace std;

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

    int n,k;

    cin >> n >> k;

    vector<int> p = {};

    for (int i = 1; i <= n; ++i){
        p.emplace_back(i);
    }
    do{
        int am = 0;
        int frst;
        for (int i = 0; i < n; ++i){
            frst = p[i];
            for (int u = i; u < n; ++u){
                if(p[u] < frst) ++am;
            }
        }
        if(am == k){
            for (const auto &item : p){
                cout << item << ' ';
            }
            break;
        }
    }
    while(std::next_permutation(p.begin(), p.end()));

    flush(std::cout);
}

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

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED