Rodent's Revenge

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int n, k;
int a[101010];

int main()
{
    cin >> n >> k;
    int m = n;
    int q = k;
    while (q >= -1) {
        a[n-q] = m;
        m--;
        q--;
    }
    for (int i = 1; i < n-k; i++) {
        a[i] = i;
    }
    for (int i = 1; i <= n; i++) {
        cout << a[i] << " ";
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED