WA4个点，求条

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6+5;
int main() {
	int a[maxn], n, k;
	cin >> n >> k;
	for (int i = 0; i < n; i++) cin >> a[i];
	sort(a, a + n);
	int cot = 1, Next = a[0];
	for (int i = 1; i < n - 1; i++) {
		if (Next == a[i + 1]) continue;
		if (Next != a[i + 1] - 1) {
			cot = 1;
		} else {
			cot++;
		}
		if (cot >= k) {
			cout << "Yes";
			return 0;
		}
		Next = a[i + 1];
	}
	cout << "No";
}