简单

#include <bits/stdc++.h>
using namespace std;
bool isSorted(const vector<int>& arr) {
for (int i = 0; i < arr.size() - 1; ++i) {
if (arr[i] > arr[i+1]) {
return false;
}
}
return true;
}

int main() {
int n, m;
vector<int> arr;

cin >> n;
for (int i = 0; i < n; ++i) {
    int num;
    cin >> num;
    arr.push_back(num);
}

cin >> m;

int swap_count = 0;
bool finished_early = false;
for (int round = 1; round <= m; ++round) {
    if (isSorted(arr)) {
        finished_early = true;
        break;
    }
    swap_count = 0;
    for (int j = 0; j < n - round; ++j) {
        if (arr[j] > arr[j+1]) {
            swap(arr[j], arr[j+1]);
            swap_count++;
        }
    }
    if (round == m) {
        break;
    }
}
if (finished_early) {
    cout << "FINISH" << endl;
} else {
    for (int i = 0; i < n; ++i) {
        cout << arr[i];
        if (i != n - 1) {
            cout << " ";
        }
    }
    cout << endl;
    cout << swap_count << endl;
}

}