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
67
68
69
70
71
72
73
74
#include <iostream>
#include <algorithm>
bool doubleOrMore(int tab[], int n, int value);

int main()
{
    int n, k;
    std::cin >> n >> k;
    int* bottles = new int[n];
    for (int i = 0; i < n; i++)
    {
        std::cin >> bottles[i];
    }
    int moves = 0;
    for (int i = k - 1; i >= 0; i--)
    {
        if (doubleOrMore(bottles, k, bottles[i])) // this element needs to be romeved from the list
        {
            bool found = false;
            int index = k;
            while (!found)
            {
                if (index >= n)
                {
                    std::cout << -1;
                    return 0;
                }
                if (!doubleOrMore(bottles, k, bottles[index])) 
                {
                    found = true; 
                }
                else
                {
                    index++;
                }
            }

            // swap found element to the edge
            for (int j = index; j > k; j--)
            {
                std::swap(bottles[j], bottles[j - 1]);
                moves++;
            }

            // swap all element son the road from i to found
            for (int j = i; j < k; j++)
            {
                std::swap(bottles[j], bottles[j + 1]);
                moves++;
            }

        }
    }
    std::cout << moves;


    delete[] bottles;
}

bool doubleOrMore(int tab[], int n, int value)
{
    int counter = 0;
    for (int i = 0; i < n; i++)
    {
        if (tab[i] == value)
        {
            if (counter > 0)
                return true;
            counter++;
        }
    }

    return false;
}