Vector Sort

Erasing_in_vector.cpp

@@ -0,0 +1,36 @@
+/*
+    You are provided with a vector of  integers. Then, you are given  queries.
+    For the first query, you are provided with  integer, which denotes a position in the vector.
+    The value at this position in the vector needs to be erased. The next query consists of  integers denoting a range of the positions in the vector.
+    The elements which fall under that range should be removed.
+    The second query is performed on the updated vector which we get after performing the first query.
+*/
+#include <cmath>
+#include <cstdio>
+#include <vector>
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+
+int main() {
+    /* Read input from STDIN. Print output to STDOUT */
+    int n,x,a,b,temp;
+    vector<int> v;
+    cin>>n;
+    for(int i=0;i<n;++i){
+        cin>>temp;
+        v.push_back(temp);
+    }
+    cin>>x;
+    cin>>a>>b;
+    v.erase(v.begin()+x-1);
+    v.erase(v.begin()+a-1,v.begin()+b-1);
+    cout<<v.size()<<endl;
+    for(int j=0;j<v.size();++j){
+        cout<<v[j]<<" ";
+    }
+
+    return 0;
+}
+

sorting/Sort_vector.cpp

@@ -0,0 +1,24 @@
+//sorting of n integers using vector
+#include <cmath>
+#include <cstdio>
+#include <vector>
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+
+int main() {
+    /* Read input from STDIN. Print output to STDOUT */
+    int n,x;
+    vector<int> v;
+    cin>>n;
+    for(int i=0; i<n; ++i)
+     {   cin>>x;
+        v.push_back(x);
+     }
+    sort(v.begin(),v.end());
+    for(int i=0;i<n;++i)
+        cout<<v[i]<<" ";
+
+    return 0;
+}