题解 | 【模板】序列操作

这题考察的是对于vector的掌握，注意一下vector库中提供的函数于题干要求的区别即可 。

#include <iostream>
#include <vector>
#include<algorithm>
using namespace std;
bool comper(int a,int b){
    return a>b;
}

void Solve(vector<int>& v){
    int n;
    cin>>n;
    int i;
    int x;
    switch (n){
        case 1:
            cin>>x;
            v.push_back(x);
            break;
        case 2:
            v.pop_back();
            break;
        case 3:
            cin>>i;
            cout<<v[i]<<endl;
            break;
        case 4:
            cin>>i;
            cin>>x;
            v.insert(v.begin()+i+1,x);
            break;
        case 5:
            sort(v.begin(),v.end());
            break;    
        case 6:
            sort(v.begin(),v.end(),comper);
            break;
        case 7:
            cout<<v.size()<<endl;;
            break;
        case 8:
            for (int k:v){
                cout<<k<<" ";
            }
            cout<<endl;
            break;
    }


}

int main() {
    vector<int> v;
    int q;
    cin>>q;
    while(q-->0){
        Solve(v);
    }

}