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;


long long solve(int n, int k, const vector <int> &arr) {
    vector <bool> seen(n, false);

    int numSeen = 0;
    long long ans = 0;

    for (int i = 0; i < n; i++) if (!seen[arr[i]]) {
        seen[arr[i]] = true;

        ans += i - numSeen;
        numSeen++;

        if (numSeen == k) {
            return ans;
        }
    }

    return -1;
}

int main() {
    ios_base::sync_with_stdio(false);

    int n, k;
    cin >> n >> k;

    vector <int> arr(n);
    for (int &ai : arr) {
        cin >> ai; ai--;
    }

    cout << solve(n, k, arr);

    return 0;
}