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

int main()
{
    long n, k, g, temp;
    cin >> n >> k;
    long brand[n];
    long time = 0;
    bool possible = true;
    for(long i = 0; i < n; i++)
    {
        cin >> brand[i];
    }
    for(long i = 0; i < k - 1; i++)
    {
        for(long j = i + 1; j < k; j++)
        {
            g = 1;
            while(brand[i] == brand[j])
            {
                if(brand[i] == brand[j + g])
                {
                    g++;
                    if(j + g >= n)
                    {
                        possible = false;
                        break;
                    }
                }
                else
                {
                    temp = brand[j + g - 1];
                    brand[j + g - 1] = brand[j + g];
                    brand[j + g] = temp;
                    g--;
                    time++;
                }
            }
            if(possible == false)
                break;
        }
    }
    if(possible)
        cout << time;
    else
        cout << -1;
    return 0;
}