diff --git a/CPP/Problems/49a.cpp b/CPP/Problems/49a.cpp
new file mode 100644
index 00000000..840d794c
--- /dev/null
+++ b/CPP/Problems/49a.cpp
@@ -0,0 +1,28 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+
+string s;
+getline(cin,s);
+
+int l=s.length();
+int f=0;
+for (int i=l;i=0;i--){
+if (s[i]!=' ' || s[i]!='?'){
+    if (s[i]=='A' || s[i]=='E' || s[i]=='I' || s[i]=='O' || s[i]=='U' || s[i]=='Y' || s[i]=='a' || s[i]=='e' || s[i]=='i' || s[i]=='o' || s[i]=='u' || s[i]=='y' ){
+       f=1;
+       break;
+
+    }
+    else
+   f=0;}}
+
+   if (f==1){
+        cout<<"YES"<<endl;
+   }
+    else
+    cout<<"NO"<<endl;
+
+   
+    return 0;
+}
\ No newline at end of file
diff --git a/CPP/sorting/Heap Sort in C++ b/CPP/sorting/Heap Sort in C++
index 416e451f..0887d91c 100644
--- a/CPP/sorting/Heap Sort in C++	
+++ b/CPP/sorting/Heap Sort in C++	
@@ -1,6 +1,10 @@
+
+#include <bits/stdc++.h>
+=======
 // C++ program for implementation of Heap Sort
  
 #include <iostream>
+
 using namespace std;
  
 // To heapify a subtree rooted with node i