Inversiot

#include <iostream>
#include <string>
#include <vector>

using namespace std;

int main()
{
	int n, k;
	cin >> n >> k;
	string front = "";
	string back = "";

	int i = n - 1;

	while (i < k)
	{
		front += to_string(i + 1) + ' ';
		k -= i;
		i--;
	}

	for (int j = 0; j <= i; j++)
	{
		if (j == k) front += to_string(j + 1) + ' ';
		else back += to_string(j + 1) + ' ';
	}

	cout << front + back;

	while (1);

	return 0;
}

Test 1

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

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