fork download

copy

//shubham dextrous
 
#include<algorithm>
#include<stdlib.h>
#include<iostream>
#include<stdio.h>
using namespace std;
struct name
{
	 long long id;
     long long attr;
	 long long val;
	 long long prio;	
}namee[100004];
int cmp(struct name a,struct name b) //sorts the structure based on id first(level 1) then attr(level 2) and then priority(level 3)
{
	if(a.id<b.id)
	    return 1;
	else if(a.id>b.id)
    	return 0;
	else
	{
		if(a.attr<b.attr)
	        return 1;
	    else if(a.attr>b.attr)
	        return 0;
	    else
	    {
			if(a.prio<b.prio)
	            return 1;
	        else
	            return 0;
	    }
	}
}
long long l1,l2,l3,l4,arr1[100004],arr2[100004],arr3[100004],arr4[100004];
int main()
{
	    long long t,n,count,f,i,w,e;
 
		scanf("%lld %lld",&n,&f);
		for(i=0;i<n;i++)
			scanf("%lld %lld %lld %lld",&namee[i].id,&namee[i].attr,&namee[i].val,&namee[i].prio);
		stable_sort(namee,namee+n,cmp);
		for(i=0;i<n;i++)
			{
				arr1[i]=namee[i].id;
				arr2[i]=namee[i].attr;
			}
		while(f--)
			{
				scanf("%lld %lld",&w,&e);
				l1=lower_bound(arr1,arr1+n,w); //lower bound of w 
				l2=upper_bound(arr1,arr1+n,w); //upper bound of w
				l4=upper_bound(arr2+l1,arr2+l2,e); //upper bound of e
				printf("%lld\n",namee[l4].val);
			}
	return 0;
}

prog.cpp: In function ‘int main()’:
prog.cpp:53:33: error: invalid conversion from ‘long long int*’ to ‘long long int’ [-fpermissive]
     l1=lower_bound(arr1,arr1+n,w); //lower bound of w 
                                 ^
prog.cpp:54:33: error: invalid conversion from ‘long long int*’ to ‘long long int’ [-fpermissive]
     l2=upper_bound(arr1,arr1+n,w); //upper bound of w
                                 ^
prog.cpp:55:37: error: invalid conversion from ‘long long int*’ to ‘long long int’ [-fpermissive]
     l4=upper_bound(arr2+l1,arr2+l2,e); //upper bound of e
                                     ^
prog.cpp:39:16: warning: unused variable ‘t’ [-Wunused-variable]
      long long t,n,count,f,i,w,e;
                ^
prog.cpp:39:20: warning: unused variable ‘count’ [-Wunused-variable]
      long long t,n,count,f,i,w,e;
                    ^

Standard output is empty