Submission

Status:

(--)(x----)(x-----)(--)

Score: 0

User: admin

Language: cpp

Time: 0.003 second

Submitted On: 2025-05-18 05:56:39

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



vector<int> inversion(int N, int K) {
	vector<int> V(N);
	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[++idx] = DQ.back();
            DQ.pop_back();
            K -= k;
        } else {
            V[++idx] = DQ.front();
            DQ.pop_front();
        }
    }

    return V;
}