sort 더블릿

#include <stdio.h>
#include <algorithm>
 
using namespace std;
 
int arr[2000] = { 0 };
int brr[2000] = { 0 };
 
int main() {
    int n;
    scanf("%d", &n);
    getchar();
 
    for (int i = 0; i < n; i++) {
        scanf("%d", &brr[i]);
        arr[i] = brr[i];
    }
 
    sort(brr, brr + n);
    
    int idx = 0, tmp = 0;
    for (int i = idx; i < n; i++) {
        if (arr[i] != brr[i]) {
            idx = i;
            int flag = 0,change=0;
            for (int j = idx; j < n; j++) {
                if (arr[j] == brr[idx] && arr[j] != brr[j]) {
                    if (arr[idx] == brr[j]) {
                        swap(arr[j], arr[idx]);
                        tmp++;
                        flag++;
                    }
                    else {
                        change = j;
                    }
                }                
            }    
            if (flag == 0) {
                swap(arr[idx], arr[change]);
                tmp++;
            }
        }
    }
 
    printf("%d", tmp);
}