Submission

Status:

(PP)(PPPPP)(PPPPPP)(PP)

Score: 100

User: admin

Language: cpp

Time: 0.002 second

Submitted On: 2025-05-18 06:00:14

#include <bits/stdc++.h>
#include "inversion.h"
using namespace std;



vector<int> inversion(int N, int K) {
	vector<int> V;
	deque<int> DQ;
	int idx;
    for(int i = 1; i <= N; i++)
        DQ.push_back(i);

    for(int k = N-1; k >= 0; k--){
        if(k <= K){
            V.push_back(DQ.back());
            DQ.pop_back();
            K -= k;
        } else {
            V.push_back(DQ.front());
            DQ.pop_front();
        }
    }

    return V;
}

//main(){
//	int N,K;
//	scanf("%d%d", &N, &K);
//	auto A = inversion(N,K);
//	for (int i: A) {
//		printf("%d ", i);
//	}
//}