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
// Adam Rogowski
// Project: ora
#include <bits/stdc++.h>
using namespace std;

int n, k;

map<int, int> fst;

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

    cin >> n >> k;
    for (int i = 0; i < n; i++) {
        int a;
        cin >> a;
        if (fst.count(a) <= 0) fst[a] = i;
    }

    if (fst.size() < k) {
        cout << -1 << endl;
        return 0;
    }

    vector<int> poss;
    for (auto p : fst) {
        poss.push_back(p.second);
    }

    sort(poss.begin(), poss.end());

    long long w = 0;
    for (int i = 0; i < k; i++) {
        w += poss[i] - i;
    }

    cout << w << endl;
}