Lista

input/code.cpp: In function 'void stress()':
input/code.cpp:77:13: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   77 |             for (int i=0; i<n; i++) cout << a[i] << ' '; cout << '\n';
      |             ^~~
input/code.cpp:77:58: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   77 |             for (int i=0; i<n; i++) cout << a[i] << ' '; cout << '\n';
      |                                                          ^~~~
input/code.cpp:78:13: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   78 |             for (int i=0; i<n; i++) cout << correct[i] << ' '; cout << '\n';
      |             ^~~
input/code.cpp:78:64: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   78 |             for (int i=0; i<n; i++) cout << correct[i] << ' '; cout << '\n';
      |                                                                ^~~~
i...

#include <bits/stdc++.h>
#define all(v) begin(v), end(v)
using namespace std;


vector<int> brute(vector<int> a, int n, int k) {
    vector<int> res = a;
    for (int mask=0; mask<1<<n; mask++) {
        if (__builtin_popcount(mask) != k) continue; 
        vector<int> inds, vals;
        for (int i=0; i<n; i++) if (mask>>i&1) {
            inds.push_back(i);
            vals.push_back(a[i]);
        }
        sort(all(vals));
        vector<int> nw = a;
        for (int i=0; i<k; i++) {
            nw[inds[i]] = vals[i];
        }
        res = min(res, nw);
    };
    return res;
};
vector<int> solve(vector<int> a, int n, int k) {
    vector<int> suf_mn(n+1);
    suf_mn.back() = 1e9;
    for (int i=n-1; i>=0; i--) suf_mn[i] = min(suf_mn[i+1], a[i]);
    for (int i=0; i<n; i++) {
        if (a[i] != suf_mn[i]) {
            int j = -1;
            for (int z=n-1; z>=0; z--) {
                if (a[z]==suf_mn[i]) {
                    j = z;
                    break;
                }
            }
            if (j>i) {
                swap(a[i], a[j]);
                ///cout << "SWOP" << i << ' ' << j << endl;
                if (k==3) {
                    bool f = false;
                    for (int z=i+1; z<j; z++) {
                        if (a[z] > a[j]) {
                            //cout << "ZZZ" << z << '\n';
                            swap(a[z], a[j]);
                            f = true;
                            break;
                        };
                    };
                    if (!f) {
                        int mn = min(a[j], suf_mn[j+1]);
                        for (int z=n-1; z>j; z--) {
                            if (a[z] == mn) {
                                swap(a[z], a[j]);
                                break;
                            }
                        };
                    };
                }
            };
            break;
        };
    };
    return a;
};
mt19937 gen(0);
void stress() {
    int k = 3;
    int n = 5;
    while (true) {
        cout << "----\n";
        vector<int> a(n);
        for (int i=0; i<n; i++) a[i] = gen()%n+1;
        auto correct = brute(a, n, k);
        auto res = solve(a, n, k);
        if (correct != res) {
            for (int i=0; i<n; i++) cout << a[i] << ' '; cout << '\n';
            for (int i=0; i<n; i++) cout << correct[i] << ' '; cout << '\n';
            for (int i=0; i<n; i++) cout << res[i] << ' '; cout << '\n';
            exit(1);
        };
    };
};

void $() {
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for (auto &u: a) cin >> u;
    vector<int> res;
    if (k>=4) {
        res = brute(a, n, k);
    } else {
        res = solve(a, n, k);
        };
    for (auto i: res) cout << i << ' ';
    cout << '\n';
    return;
}
int main() {
    //stress();
    cin.tie(0)->sync_with_stdio(0);
    $();
}

Test 1 (public)

Group: 1, 3, 4, 5, 6

Verdict: ACCEPTED

Test 2 (public)

Group: 1, 4, 5, 6

Verdict: ACCEPTED

Test 3

Group: 1, 2, 4, 5, 6

Verdict: ACCEPTED

Test 4

Group: 1, 2, 4, 5, 6

Verdict: ACCEPTED

Test 5

Group: 1, 2, 4, 5, 6

Verdict: ACCEPTED

Test 6

Group: 1, 3, 4, 5, 6

Verdict: ACCEPTED

Test 7

Group: 1, 4, 5, 6

Verdict: ACCEPTED

Test 8

Group: 1, 4, 5, 6

Verdict: ACCEPTED

Test 9

Group: 1, 4, 5, 6

Verdict: ACCEPTED

Test 10

Group: 1, 2, 4, 5, 6

Verdict: ACCEPTED

Test 11

Group: 1, 4, 5, 6

Verdict: ACCEPTED

Test 12

Group: 1, 4, 5, 6

Verdict: ACCEPTED

Test 13

Group: 1, 4, 5, 6

Verdict: ACCEPTED

Test 14

Group: 2, 6

Verdict: ACCEPTED

Test 15

Group: 2, 6

Verdict: ACCEPTED

Test 16

Group: 2, 6

Verdict: ACCEPTED

Test 17

Group: 2, 6

Verdict: ACCEPTED

Test 18

Group: 2, 6

Verdict: ACCEPTED

Test 19

Group: 2, 6

Verdict: ACCEPTED

Test 20

Group: 1, 3, 4, 5, 6

Verdict: ACCEPTED

Test 21

Group: 3, 6

Verdict: ACCEPTED

Test 22

Group: 3, 6

Verdict: ACCEPTED

Test 23

Group: 3, 6

Verdict: ACCEPTED

Test 24

Group: 3, 6

Verdict: ACCEPTED

Test 25

Group: 3, 6

Verdict: ACCEPTED

Test 26

Group: 3, 6

Verdict: ACCEPTED

Test 27

Group: 4, 6

Verdict: WRONG ANSWER

Test 28

Group: 4, 6

Verdict: WRONG ANSWER

Test 29

Group: 4, 6

Verdict: WRONG ANSWER

Test 30

Group: 2, 4, 6

Verdict: ACCEPTED

Test 31

Group: 4, 6

Verdict: WRONG ANSWER

Test 32

Group: 4, 6

Verdict: WRONG ANSWER

Test 33

Group: 5, 6

Verdict: WRONG ANSWER

Test 34

Group: 5, 6

Verdict: WRONG ANSWER

Test 35

Group: 5, 6

Verdict: WRONG ANSWER

Test 36

Group: 2, 5, 6

Verdict: ACCEPTED

Test 37

Group: 5, 6

Verdict: WRONG ANSWER

Test 38

Group: 6

Verdict: WRONG ANSWER

Test 39

Group: 6

Verdict: WRONG ANSWER

Test 40

Group: 6

Verdict: WRONG ANSWER

Test 41

Group: 2, 5, 6

Verdict: ACCEPTED

Test 42

Group: 5, 6

Verdict: WRONG ANSWER

Test 43

Group: 1, 3, 4, 5, 6

Verdict: ACCEPTED

Test 44

Group: 1, 2, 4, 5, 6

Verdict: ACCEPTED

Test 45

Group: 1, 4, 5, 6

Verdict: ACCEPTED