旧式火车站车厢排序问题的代码实现

```cpp #include <iostream> using namespace std; int a[100]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } int sum = 0; for (int i = 1; i <= n - 1; i++) { bool flag = false; for (int j = 1; j <= n - i; j++) { if (a[j] > a[j + 1]) { swap(a[j], a[j + 1]); sum++; flag = true; } } if (!flag) { break; } } cout << sum; return 0; } ``` ######[AI问答 | 219点数解答 | 2026-04-04 20:09:49]