题解 | 【模板】序列操作

#include <iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<functional>
int main() {
    int q;
    cin >> q;
    vector<int>v;
    while (q--) {
        int select;
        cin >> select;
        switch (select) {
            int i,x;
            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.insert(v.begin()+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 (vector<int>::iterator it = v.begin(); it != v.end(); it++) {
                    cout << (*it) << " ";
                }
                cout << endl;
                break;
        }
    }

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