solve the dsa question

Here is the C++ solution:

cpp
#include <iostream>
#include <vector>
using namespace std;

int findPosition(vector<int>& arr, int V)
{
    int sum = 0;

    for (int i = 0; i < arr.size(); i++)
    {
        sum += arr[i];

        if (sum >= V)
        {
            return i + 1;   // position starts from 1
        }
    }

    return -1;
}

int main()
{
    int N;
    cin >> N;

    vector<int> arr(N);

    for (int i = 0; i < N; i++)
    {
        cin >> arr[i];
    }

    int V;
    cin >> V;

    cout << findPosition(arr, V);

    return 0;
}

Logic: keep adding elements from the beginning. The first time the cumulative sum becomes greater than or equal to V, print that position. Since positions start from 1, return i + 1.