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
#include <iostream>
#include <vector>
#include <set>

using namespace std;

void solve(){
    int n, k;
    cin >> n >> k;

    vector<int> vBrands(n);
    set<int> sBrands;

    for(int i = 0; i < n; i++) {
        cin >> vBrands[i];
        sBrands.insert(vBrands[i]);    
    }

    if(sBrands.size() < k) {
        cout << -1 << "\n";
        return;
    }

    sBrands.clear();

    long long result = 0;
    int lastBottle = -1;

    for(int i = 0; i < n; i++) {
        if(sBrands.count(vBrands[i]) == 0) {
            lastBottle++;
            result += i - lastBottle;
            sBrands.insert(vBrands[i]);
            if(sBrands.size() == k) break;
        }
    }

    cout << result << "\n";
}

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

    solve();

    return 0;
}