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
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
#include <bits/stdc++.h>

int swapSortDifference(int* arr, int n){
	
	std::vector<std::pair<int,int>> pos;
	for(int i = 0; i < n; i++){
		
			pos.push_back({arr[i],i});
			
	}
	
	std::sort(pos.begin(),pos.end());
	
	std::vector<bool> visited(n,0);
	
	int difference = 0;
	
	for(int i = 0; i < n; i++){
		
		if(visited[i] || pos[i].second == i){
			
				continue;
				
		}
		
		int cycle = 0;
		int j = i;
		
		while(!visited[j]){
		
				visited[j] = 1;
				
				j = pos[j].second;
				cycle++;
			
		}
		
		difference += cycle - 1;
		
		
	}
	
	
	return difference;
}


int arrDifference(int* arr0, int* arr1, int n){
	
	
	std::map<int,int> map_pos;
	
	for(int i = 0; i < n; i++){
		
			map_pos[arr1[i]] = i;
		
	}
	
	for(int i = 0; i < n; i++){
	
			arr1[i] = map_pos[arr0[i]];
		
	}
	
	return swapSortDifference(arr1,n);
	
}



int main(){
	
	int n;
	int k;
	
	std::cin >> n >> k;
	
	int a[n];
	
	for(int i = 0; i < n; i++){
		
		std::cin >> a[i];
		
	}
	
	
	int b[n] = { 0 };
	std::unordered_map<int,bool> begin;
	std::vector<int> rest;
	
	int current = 0;
	
	
	
	for(int i = 0; i  < n; i++){
			
		auto pos = begin.find(a[i]);
		if(pos == begin.end() && current < k){
				
				b[current++] = a[i];
				begin.insert({a[i],true});
				
		} else {
				
				rest.push_back(a[i]);
			
		}
			
	}	
	
	
	if(current < k){
			
			std::cout << -1 << std::endl;
			
			return 0;
	}
	
	for(int i = 0;i < rest.size(); i++){
		
		b[current++] = rest[i];
			
	}
	
	
	std::cout << arrDifference(a,b,n) << std::endl;
	
	
}