魔法行为，数组长度应该是一个常数
by 7The_shy @ 2023-12-23 16:49:09
还有应该是a[i] < a[j]不是l[j]>l[j+1]
by 7The_shy @ 2023-12-23 16:50:39
建议把i<n,j<n改为i<n-1,j<n-1;
by Zichen123 @ 2024-01-15 22:41:31
```cpp
用冒泡排序
#include<bits/stdc++.h>
using namespace std;
int ans = 0;
int main()
{
int n,a[10000] = {0};
cin >> n;
for (int i = 0;i < n;i++)
{
cin >> a[i];
}
for (int i = 0;i < n - 1;i++)
{
for (int j = i + 1;j < n;j++)
{
if(a[j] < a[i])
{
swap(a[i],a[j]);
ans++;
}
}
}
cout << ans;
return 0;
}
```
by Dark_Monarch @ 2024-01-20 17:42:48