原始人弃洞

#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n + 1] = {0};
for (int i = 1; i <= n; i++) cin >> a[i];
//冒泡算法=======
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n - i; j++) {
if (a[j] > a[j + 1]) {
swap(a[j], a[j + 1]);
}
}
if (i == m) {//按照约定，到第m轮停止
break;
}
}
//==============================
for (int i = 1; i <= n; i++) cout << a[i] << " ";
return 0;
}