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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include <iostream>
#include <vector>

using namespace std;

// BARTOSZ KAMIŃSKI RADOM 

int main(){


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

    int a[n];

    for(int i = 0; i<n; ++i)
        cin >> a[i];


    vector<int> uniq(k,-1);
    vector<int> same(n,-1);

    uniq[0] = 0;
    //cout << " pocza " << n << " " << k << endl;
    int u = 1,s=0;

    

    for(int i = 1; i<n; ++i){
       
        bool found = true;

            for(int h = 0; h<u ; h++){

               // cout << i <<  " h " << a[i] << " " <<  a[uniq[h]] << " " << h << endl;

                if(a[i] == a[uniq[h]]){
                    same[s++] = i;
                    found = false;
                    break;
                }

                
            }
            if(found == true){

                uniq[u++] = i;

            }


    }
    int time = 0;
    bool moge = true;
    if(u < k){
		time =-1;
        moge = false;
    }

    

    for(int i = 0; i<k && moge == true; ++i){

        if(uniq[i] == i)
            continue;
        time += uniq[i] - i;
    }

    cout << time;


    return 0;
}