提交时间:2024-01-25 09:05:55
运行 ID: 127437
#include<iostream> #include<algorithm> using namespace std; int n,a[50005]; int bubble_sort(int *a, int n) { bool flag = true; int ans=0; while (flag) { flag = false; for (int i = 1; i < n; ++i) { if (a[i] > a[i + 1]) { flag = true; int t = a[i]; a[i] = a[i + 1]; a[i + 1] = t; ans++; } } } return ans; } signed main(){ cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]; } cout<<bubble_sort(a,n); return 0; }