#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
	int n,m,i,j,k,counter;
	vector <long> a(1),b(1);
	scanf("%d%d",&n,&m);
	a.resize(n);
	for(i=0;i<n;i++)
		scanf("%d",&a[i]);
	while(m--)
	{
		scanf("%d%d%d",&i,&j,&k);
		b.resize(j-i+1);
        for(counter=0;counter<=j-i;counter++)
			b[counter]=a[counter+i-1];
		sort(b.begin(),b.end());
		printf("%d\n",*(b.begin()+k-1));
	}
	return 0;
}

• m*快排 想想看就知道超时了 (0) 785815369 2010-08-02 09:07:05
• Re:都做到这个份上了，怎么还超时 (633) lijingwei 2010-08-06 09:03:07
  • Re:都做到这个份上了，怎么还超时 (713) zcube 2011-03-25 20:09:46
    • Re:都做到这个份上了，怎么还超时 (6) zcube 2011-03-25 20:10:39