For this Question: You are given a string of length N consisting of lowercase english alphabets(a-z), in which you are allowed to change at most k consonants into a vowel (a, e, i, o, u).
Find the longest substring that consists of only vowels after changing at most k consonants into vowels.First line of input consists of two integers N and k.
Second line consists of a string of length N.

Constraints:-
0 <= N <= 10^5
0 <= k <= N

String will contain only lowercase english lettersA single integer showing the length of the longest substring consisting of only vowels.Sample Input:-
11 2
aoibbboeaub

Sample Output:-
6

Explanation:-
One of the possibility is:-
aoibbboeaub => aoibbeoeaue (two b(s) converted to e)

now the longest substring is *eoeaue* which consists of only vowels., I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
bool check(char c){
    if(c=='a' || c=='e' || c=='i' || c=='o' || c=='u'){return true;}
    else{
        return false;
    }
}

int main() {

int n,k;
    cin>>n>>k;
    string s;
    cin>>s;
    int j=0;
    int cnt=0;
    int ans=0;
    for(int i=0;i<n;i++){
        if(s[i]=='a' || s[i]=='e' || s[i]=='i' || s[i]=='o' || s[i]=='u'){
            ans=max(ans,i-j+1);
            continue;}
        else{
            cnt++;
            if(cnt>k){
                while(j<=i && check(s[j])){
                    j++;
                }
                j++;

                cnt--;
            }
            ans=max(ans,i-j+1);
           // cout<<ans<<endl;
        }

    }

        ans=max(ans,n-j);
    cout<<ans;

}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?