提交时间:2024-01-25 09:20:24
运行 ID: 127508
#include <iostream> #include <algorithm> using namespace std; int a[501000]; int main() { int n; cin >> n; int cnt = 0; for(int i = 1; i <= n; i++) cin >> a[i]; for(int i = 1; i <= n; i++) for(int j = i + 1; j <= n; j++) if(a[j] < a[i]) {swap(a[j], a[i]); cnt++;} cout << cnt << endl; return 0; }