90分，大佬救救我！

#include<bits/stdc++.h>
using namespace std;
long long arr[100000],brr[100000];
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		
		cin>>arr[i] ;
		brr[i] = arr[i];
	}
	sort(brr+1,brr+n+1);
	int count = 0; 
	int k1=1,k2=1;
	while(k1<=n){
		if(arr[k1] == brr[k1]){
			k1++;
		}
		else{
			k2 = k1;
			while(arr[k1] != brr[k2]){
				k2++;
			}
			swap(arr[k1],arr[k2]);
			count++;
		}
	}
	cout<<count;
	return 0;
}