Fila - Neps Academy

#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <stack>
#include <list>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <string.h>
#include <sstream>

using namespace std;


main()
{
    ios::sync_with_stdio(0);
    int n, q, a, b, c;
    vector<int> vec;
    vector<int>::iterator it;
    cin >> n;
    for(int i=0; i<n; i++){
        int x;
        cin >> x;
        vec.push_back(x);
    }
    cin >> q;
    for(int i=0; i<q; i++){
        cin >> a >> b >> c;
        if(!a){
            vec.insert(vec.begin()+b, c);
        }else{
            bool finded = 0;
            for(int i=b-2; i>=0; i--){
                if(vec[b-1]+c < vec[i]){
                    cout << i+1 << '\n';
                    finded = 1;
                    break;
                }
            }
            if(!finded)
                cout << 0 << '\n';
        }
    }

    return 0;
}