代码好多重复，不过可以copy

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
ll n,k;
ll a[1500000];
ll minn = 99999999999999;
ll m_p = -1;

ll maxx = -99999999999999;
ll max_pos = -1;
void s() {
    for (int i = 2; i <= n-k + 1;i++) {
        if (minn > a[i + k - 1]) {
            minn = a[i + k - 1];
            m_p = i+k-1;
        }else {
            if (m_p == i-1) {
                minn = 99999999999;
                for (int j = i; j < i+k;j++) {
                    if (minn >= a[j]) {
                        minn = a[j];
                        m_p = j;
                    }
                }
            }
        }
        cout<<minn<<" ";
    }
}

void m() {
    for (int i = 2; i <= n-k + 1;i++) {
        if (maxx < a[i + k - 1]) {
            maxx = a[i + k - 1];
            max_pos = i+k-1;
        }else {
            if (max_pos == i-1) {
                maxx = -99999999999;
                for (int j = i; j < i+k;j++) {
                    if (maxx <= a[j]) {
                        maxx = a[j];
                        max_pos = j;
                    }
                }
            }
        }
        cout<<maxx<<" ";
    }
}

void solve() {
    cout<<minn<<" ";
    s();

    cout<<endl;
    cout<<maxx<<" ";
    m();
}

int main() {
    cin >> n >> k;
    for (int i = 1; i <=n;i++) {
        cin >> a[i];
        if (i <= k) {
            if (maxx <= a[i]) {
                maxx = a[i];
                max_pos = i;
            }
            if (minn >= a[i]) {
                minn = a[i];
                m_p = i;
            }
        }
    }
    solve();

    return  0;
}