Urkupillit

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
 
using namespace std;
 
int main()
{
    cin.tie(0);
    cin.sync_with_stdio(false);
    int n, k;
    cin>>n>>k;
 
    int urut[n];
    for (int x = 0; x < n; x++) urut[x] = 0;
    int i = 0;
    int val = 0;
 
    while (i != k) {
        urut[min(n - val, k - i)] = val;
        i += urut[min(n - val, k - i)];
        val++;
    }
 
    int index = 0;
    while (val <= n) {
        if (urut[index] == 0) {
            urut[index] = val;
            val++;
        }
        index++;
    }
 
    for (int z : urut) {
        cout<<z<<" ";
    }
    cout<<endl;
 
    return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: RUNTIME ERROR

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: RUNTIME ERROR

Test 9

Group: 2

Verdict: RUNTIME ERROR

Test 10

Group: 2

Verdict: RUNTIME ERROR

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: RUNTIME ERROR

Test 13

Group: 3

Verdict: RUNTIME ERROR

Test 14

Group: 3

Verdict: RUNTIME ERROR

Test 15

Group: 3

Verdict: RUNTIME ERROR