题解 | 【模板】序列操作

#include <bits/stdc++.h>
#include <functional>
using namespace std;

vector<int> v;
int main() {
    int q,op,x,i;
    cin >> q;
    for (int j=0;j<q;j++)
    {
        cin >> op;
        switch (op) {
            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 >> x;
                v.push_back(0);
                for(int k=v.size();k>i+1;k--)
                {
                    v[k] = v[k-1];
                }
                v[i+1]=x;
                break;
            case 5: 
                sort(v.begin(),v.end());
                break;
            case 6: 
                sort(v.begin(),v.end(),greater<int>());
                break;
            case 7: 
                cout << v.size() << endl;
                break;
            case 8: 
                for (int k: v)
                {
                    cout << k << " " ;
                }
                 cout << endl ;
                break;

        }
    }

    return 0;
}
// 64 位输出请用 printf("%lld")