View Code of Problem 134

#include<stdio.h>
#include<stdlib.h>
typedef struct sz{
	int id;
	int num;	
}sz;
cmp(const void *_a,const void *_b)
{
	sz* a=(sz*)_a;
	sz* b=(sz*)_b;
	return (a->num-b->num);
}
sz a[100001];
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
 
		
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i].num);
			a[i].id=i+1;
		}
		qsort(a,n,sizeof(sz),cmp);
		int q;
		scanf("%d",&q);
		int l,r;
		int i,j;
		for(i=0;i<q;i++)
		{
			scanf("%d %d",&l,&r);
			for(j=0;j<n;j++)
			{
				if(a[j].id>=l&&a[j].id<=r)
				{
					break;
				}
			}
			printf("%d\n",a[j].num);
		}
	}
} 

Double click to view unformatted code.


Back to problem 134