Function main

CodeChef_problems/CLPNT/solution.cpp:17–59

using namespace std;

signed main()
{
    int t;
    cin >> t;
    while (t--)
    {
        ll n, q, i, j;
        cin >> n;
        vector<ll> a(n);
        //Taking input of array a[]
        for (i = 0; i < n; i++)
            cin >> a[i];
        cin >> q;
        //Processing the queries
        while (q--)
        {
            ll x, y;
            cin >> x >> y;
            //Adding the points as the equation is x+y
            x += y;
            //Applying the binary search function in array a[]
            auto it = upper_bound(a.begin(), a.end(), x);
            //If the point is below every given line, answer is 0
            if (it == a.begin())
                cout << "0"
                     << "\n";
            else
            {
                it--;
                //If the point lies on a line we output the answer as -1
                if (*it == x)
                    cout << "-1"
                         << "\n";
                else
                {
                    //The answer is the index we found in the array
                    ll ans = (it - a.begin()) + 1;
                    cout << ans << "\n";
                }
            }
        }
    }
}