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
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;

    map<int, int> o;

    int cur = 0;
    long long res = 0;
    
    for(int i=0; i<n; i++){
        int x;
        cin >> x;
        if(cur<k){
            if(o[x]==0){
                o[x]++;
                res += i-cur;
                cur+=1;
            }
        }
    }

    if(cur==k){
        cout << res;
    }else{
        cout << -1;
    }
}