The Water Problem(排序)

Time Limit: 1500/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 816    Accepted Submission(s): 657

Problem Description

In Land waterless, water is a very limited resource. People always fight for the biggest source of water. Given a sequence of water sources with .

 

 

Input

First you are given an integer indicating the range of which you should find out the biggest water source.

 

 

Output

For each query, output an integer representing the size of the biggest water source.

 

 

Sample Input

3 1 100 1 1 1 5 1 2 3 4 5 5 1 2 1 3 2 4 3 4 3 5 3 1 999999 1 4 1 1 1 2 2 3 3 3

 

 

Sample Output

100 2 3 4 4 5 1 999999 999999 1

代码：

 1 #include<stdio.h>
 2 #include<stdlib.h> 
 3 #include<string.h>
 4 const int MAXN=1010;
 5 int cmp(const void *a,const void *b){
 6     if(*(int *)a<*(int *)b)return 1;
 7     else return -1;
 8 }
 9 int main(){
10     int m[MAXN],T,N,q,l,r,n[MAXN];
11     scanf("%d",&T);
12     while(T--){
13         scanf("%d",&N);
14         for(int i=1;i<=N;i++)
15             scanf("%d",m+i),n[i]=m[i];
16         scanf("%d",&q);
17         while(q--){
18             scanf("%d%d",&l,&r);
19             for(int i=1;i<=N;i++)
20                 m[i]=n[i];
21             qsort(m+l,r-l+1,sizeof(m[0]),cmp);
22             printf("%d\n",m[l]);
23         }
24     }
25     return 0;
26 }