3049-Securing the Barn ====dfs

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
char pass[20];
char yy[10];
char fy[30];
int sum[30];
bool ifyy(char c)
{
return (c=='a' || c== 'e' || c== 'i' || c=='o' || c=='u');
}
int main()
{
int L,C;
int yycount=0;
int fycount=0;
scanf("%d %d",&L,&C);
int now=0;
while(now<C)
{
char c;
scanf("%c",&c);
if(c>='a' && c<='z')
{
sum[now]=c;
now++;
}
}

for(int i = 0 ;i< C;i++)
{
if(ifyy(sum[i]))
{
yy[yycount]=sum[i];
yycount++;
}
else
{
fy[fycount]=sum[i];
fycount++;
}
}
sort(yy,yy+yycount);
sort(fy,fy+fycount);


}