60分qwq

代码：

#include <iostream>
#include <algorithm>
using namespace std;
long long n, a[10001], b[10001], ans = 0, t;
int main(){
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
		b[i] = a[i];
	}
	sort(a + 1, a + n + 1);
	for(int i = 1; i <= n - 1; i++){
		for(int j = i + 1; j <= n; j++){
			if(a[i] == b[j]){
				ans++;
				t = b[i];
				b[i] = b[j];
				b[j] = t;
			}
		}
	}
	cout << ans << endl;
	return 0;
}