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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n,k;
    cin >> n >> k;
    vector<int>Brands(n);
    for(int &b : Brands)
        cin >> b;

    bool success = false;
    long long result = 0;
    set<int>BrandsTaken;
    for (int i = 0; i < n; i++)
        if (!BrandsTaken.count(Brands[i])) {
            result += i - BrandsTaken.size();
            BrandsTaken.insert(Brands[i]);
            if (BrandsTaken.size() == k) {
                success = true;
                break;
            }
        }
    
    cout << (success ? result : -1) << endl;
    return 0;
}