Optimal sort

input/code.cpp: In function 'int main()':
input/code.cpp:40:27: error: cannot convert '__gnu_cxx::__normal_iterator<int*, std::vector<int> >' to 'int' in initialization
   40 |             int ind = find(numbers.begin(), numbers.end(), sorted[i]);
      |                       ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                           |
      |                           __gnu_cxx::__normal_iterator<int*, std::vector<int> >

#include <iostream>
#include <vector>
#include <algorithm>
#include <bits/stdc++.h>

using namespace std;
int n;
int input;
vector<int> numbers;
vector<int> sorted;

int FindIndex(vector<int>& v, int y) {
    for (unsigned long i = 0; i < v.size(); i++) {
        if (v[i] == y) {
            return i;
        }
    }
    return 0;
}

bool comp(int a, int b) {
    return a < b;
}

int main() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> input;
        // cout << "number ";
        // cout << input << endl;
        numbers.push_back(input);
        sorted.push_back(input);
    }

    stable_sort(sorted.begin(), sorted.end(), comp);

    int j = 0;
    for (int i = 0; i < n; i++) {
        if (sorted[i] != numbers[i]) {
            int ind = find(numbers.begin(), numbers.end(), sorted[i]);
            // cout << ind << endl;
            auto number = numbers[i];
            numbers[i] = sorted[i];
            numbers[ind] = number;
            j += 1;
        }
    }
    cout << j;
    return 0;
}