MinSwapsEleLessThanKTogether.cpp

#include<iostream>
using namespace std;
int minswapk(int a[],int n,int k)
{int count=0;
for(int i=0;i<n;i++)
{if(a[i]<=k)
{count++;}
}
int bad=0;
for(int i=0;i<count;i++)
{if(a[i]>k)
{bad++;}
}
int ans=bad;
for(int i=0,j=count;j<n-1;i++,j++)
{if(a[i]>k)
{bad--;}
if(a[j]>k)
{bad++;}}
ans=min(ans,bad);
return ans;}


int main() {
    int a[5]={2,4,5,7,1};
    cout<<minswapk(a,5,6);
}