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
#include <bits/stdc++.h>

using namespace std;

#define int long long

int32_t main()
{
    int n, k;
    cin >> n >> k;

    vector<int> a(n);
    for (int i = 0; i < n; ++i)
    {
        cin >> a[i];
        --a[i];
    }
    vector<int> t(n, 0);

    int i = 0;
    int j = 1;
    int moves = 0;
    while (i < k && i < n && j < n)
    {
        if (!t[a[i]])
        {
            t[a[i]] = 1;
            ++i;
        }
        else
        {
            if (a[i] != a[j] && !t[a[j]])
            {
                moves += j - i;
                swap(a[i], a[j]);
                t[a[i]] = 1;
                ++i;
            }
            else
            {
                ++j;
            }
        }
    }

    if (i == k)
    {
        cout << moves;
    }
    else
    {
        cout << "-1";
    }
}