Urkupillit

#include <bits/stdc++.h>

#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define vpii vector<pii>
#define vi vector<int>

using namespace std;

int main() {
	cin.tie(0);
	
	int n,k;
	cin >> n >> k;
	vi ls;
	for(int i=0;i<n;i++) {
		ls.pb(i+1);
	}
	
	do {
		bool isvalid=false;
		int c = 0;
		for(int i=0;i<n;i++) {
			for(int j=i;j<n;j++) {
				if(i==j) continue;
				if(ls[i]>ls[j]) c++;
				if(c==k) {
					isvalid=true;
					break;
				}
			}
			if(isvalid) break;
		} 
		if(isvalid) {
			for(int i=0;i<n;i++) {
				cout << ls[i] << " ";
			}
			break;
		}
	} while(next_permutation(ls.begin(), ls.end()));
		
	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: 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: ACCEPTED

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