Can this question be done without using stack or queue?

I tried it like this having complexity o(NlogN).why is it still getting tle.I tried using Binary search to find the insertion point and kept storing the max value in a vector.

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
 
int main()
{
    
    
    long unsigned int a,b,num,i,low,mid,high,value,k,m;
    vector<long unsigned int> v;
    vector<long unsigned int> q;
     vector<long unsigned int>ans;
    
    cin>>a>>b;

This code is giving me Tle on a number of cases even though im using the upper and lower bound techniques after sorting.is the O(N*(x+y)) complexity not enough?

 
 
 
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
    int n,num,num1,x,y,value,ans,k,j,i;
    vector <int> str;
    vector <int> end;
    vector <int> entry;
    vector <int>  ext;
    
    cin>>n>>x>>y;
    
    for(i=0;i<n;i++)
    {

why did you do (contest.second-1) in the upperbound parameter

ya thanks i solved it

I tried solving this problem by doing linear scans for every i but im still getting wrong answer.Even after sorting the array

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#include<stdio.h>
 
int main()
{
    int n,num,avg,counter,i,j,k;
    vector <int> seq;
    
    cin>>n;
    for(i=0;i<n;i++)
    {
        cin>>num;
        seq.push_back(num);
    }
    

No I mean more coding questions maybe from codeforces .or from the codechef Long contests.Because I can't go past 4 questions in codechef long contests.So some more coding questions will go a long way in improving.thnx

Thanks a lot ..This programming playlist is an awesome collection.I appreciate the hard work you put into it . However you should probably add some more practice problems which will help beginners like me to get note practice. Apart from that it's absolutely perfect

THIS code gives me segmentation fault on last case and third last case can anyone help

#include<stdio.h>
#include<stdlib.h>
 
int cmpfunc (const void * a, const void * b)
{
   return ( *(int*)a - *(int*)b );
}
 
int main()
{
    int a,b,c,i;
    scanf("%d",&a);
    scanf("%d",&b);
    scanf("%d",&c);
    int list[1000000]={0};
    int actual[1000000]={0};
    int l1[a];
    int l2[b];
    int l3[c];