1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
#include "bits/stdc++.h"

using namespace std;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, k;
    cin >> n >> k;
    vector<int> arr;
    bool ordered[500001];

    for (int i = 0; i < 500001; ++i){
        ordered[i] = true;
    }

    int input;
    for (int i = 0; i < n; ++i){
        cin >> input;
        arr.push_back(input);
    }

    int free = 1;
    ordered[arr[0]] = false;
    long long moves = 0;
    for (int i = 1; i < n && free != k; ++i){
        if (ordered[arr[i]]) {
            moves += (long long) (i - free);
            ordered[arr[i]] = false;
            ++free;
        }
    }
    if (free != k){
        cout << -1;
    } else {
        cout << moves;
    }

    return 0;
}