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

using namespace std;

#define ll long long int

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

    ll n, k;
    cin >> n >> k;
    
    ll* data = new ll[n]();
    for (ll i = 0; i < n; i++)
    {
        cin >> data[i];
    }

    ll uniqueFound = 0;
    bool* markedAlready = new bool[n + 1]();

    vector<ll> nonUniqueIndexes;
    ll endIndex = -1;

    for (ll i = 0; i < n; i++)
    {
        if (markedAlready[data[i]])
        {
            nonUniqueIndexes.push_back(i);
        }
        else
        {
            uniqueFound++;
            markedAlready[data[i]] = true;

            if (uniqueFound == k)
            {
                endIndex = i;
                break;
            }
        }
    }

    if (endIndex == -1)
    {
        cout << -1 << '\n';
        return 0;
    }

    ll totalCost = 0;
    ll elementsPushedAlready = 0;

    if (!nonUniqueIndexes.empty())
    {
        for (ll i = nonUniqueIndexes.size() - 1; i >= 0; i--)
        {
            totalCost += endIndex - nonUniqueIndexes[i] - elementsPushedAlready;
            elementsPushedAlready++;
        }
    }

    cout << totalCost << '\n';
}