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
#include <bits/stdc++.h>
using namespace std;
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n, k;
	cin >> n >> k;
	int count_diff = 0;
	int moves = 0;
	unordered_set<int> s;
	int b;
	int free_pos = 0;
	for(int i = 0; i < n; ++i) {
		cin>>b;
		if(s.find(b) == s.end()) {
			s.insert(b);
			count_diff++;
			moves += (i - free_pos);
			free_pos++;
		}
		
		if(count_diff == k) {
			break;
		}
	}
	if(count_diff < k) {
		cout << -1;
	}
	else {
		cout << moves;
	}
}