卡塔库栗 • 1个月前
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL a[10005];
bool dddd[10005];
int main() {
LL n, c, i, j;
scanf("%lld%lld", &n, &c);
for (i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
LL l = 1, r = c, k = n, minn, mi;
while (k != 0) {
minn = 9999999999;
for (i = l; i <= r; i++) {
if (a[i] < minn && dddd[i] == 0) {
minn = a[i];
mi = i;
}
}
if (k == 0) {
printf("%lld\n", minn);
} else {
printf("%lld ", minn);
}
k--;
dddd[mi] = 1;
LL z = 0;
for (j = mi - 1; j >= 1; j--) {
if (dddd[j] == 0) {
l = j;
z = 1;
break;
}
}
if (r < n) {
r++;
}
if (z == 0) {
l++;
}
}
return 0;
}
评论:
请先登录,才能进行评论