Urkupillit

#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

unsigned int urut[100001];
unsigned int n;
unsigned int k;

inline bool isDone() {
	unsigned int pairs=0;
	if (n<2) {return 0;}
	for (unsigned int i=1; i<n; ++i) {
		if (urut[i-1]>urut[i]) {
			++pairs;
		}
	}
	return (pairs==k);
}



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


	for (unsigned int i = 0; i < n; ++i) {
		urut[i] = i+1;
	}


	while (!isDone()) {
		next_permutation(urut, urut+n);
	}


	for (unsigned int i=0; i<n; ++i){cout << urut[i] << " ";}
	cout << endl;




	return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: WRONG ANSWER

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