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

using namespace std;


int main()
{
	int n, k, s = 0, pom;
	bool equal = true, differ = false;
	cin >> n >> k;
	int ora[n];
	
	for(int i=0; i<=n-1; i++)
	{
		cin >> ora[i];
		
		if((ora[i]!=pom) && i>0)
		{
			equal = false;
		} 
		
		pom = ora[i];
	}
	
	if(equal==true)
	{
		s = -1;
	} else 
	{	
		while(differ==false)
		{
			for(int j=0; j<=n-1; j++)
			{
				if((ora[j-1]==ora[j]) && j>=k-1)
				{
					swap(ora[j], ora[j+1]);
					s++;
				}
			}
			
			for(int l=0; l<=n-1; l++)
			{
				if((ora[l-1]==ora[l]) && l>=k-1)
				{
					swap(ora[l], ora[l+1]);
					s++;
				}
			}
			
			for(int m=0; m<=k-1; m++)
			{
				if(ora[m]!=ora[m+1]) 
				{
					differ = true;
				} else
				{
					differ = false;
					break;
				}
			}
		}		
	}
	
	cout << s;
	
	return 0;
}