Minimus Swaps and K together

#include <bits/stdc++.h>
using namespace std;

int minimumSwaps(vector<int>& a, int n, int k) {
    int windowSize = 0, badCount = 0;

    for (int i = 0; i < n; i++) {
        if (a[i] <= k) windowSize++;
    }

    for (int i = 0; i < windowSize; i++) {
        if (a[i] > k) badCount++;
    }

    int minSwaps = badCount;
    for (int i = 0, j = windowSize; j < n; i++, j++) {
        if (a[i] > k) badCount--;
        if (a[j] > k) badCount++;
        minSwaps = min(minSwaps, badCount);
    }

    return minSwaps;
}