苍狼 2009-06-09 17:19:00
点我顶贴
收藏
删除
program aa;
var
a,b:array[1..10000]of longint;
i,j,m,n,p,q,k:longint;
procedure qsort(m,n:longint);
var i,j:integer;k,t:longint;
begin
i:=m;j:=n;k:=a[(i+j)div 2];
repeat
while a[i]<k do inc(i);
while a[j]>k do dec(j);
if i<=j then
begin
t:=a[i];a[i]:=a[j];a[j]:=t;
inc(i);dec(j);
end;
until i>j;
if m<j then qsort(m,j);
if i<n then qsort(i,n);
end;
begin
readln(n,m);
for i:=1 to n do
read(a[i]);
b:=a;
for i:=1 to m do
begin
read(p,q,k);
qsort(p,q);
writeln(a[k+(p-1)]);
a:=b;
end;
end.
拜托大牛们了!!!!!!