<<Vector-Erase>> _HakerRank_C++_STL

#include <cmath>#include <cstdio>#include <vector>#include <iostream>#include <algorithm>using namespace std;int main() {    /* Enter your code here. Read input from STDIN. Print output to STDOUT */    int n = 0 , m = 0;     cin >> n ;        vector<int> vec(n);    for(int i = 0 ; i < n ; i++)    {       cin >> vec[i] ;    }        // erase the n-th element    cin >> n ;    vec.erase(vec.begin()+(n-1));        // erase the n-th to m-th elements:     cin >> n >> m;    vec.erase(vec.begin()+(n-1) , vec.begin()+m-1);        cout << vec.size() << endl;    for(n =0 ; n< vec.size() ; n++)    {        cout << vec[n] << " " ;      }           return 0;}