魔法照片pascal程序
题意
求出加上额外权值以后,最终的权值最大的k个人,并输出他们的编号。
分析
先排序,再一个一个求权值。
var
n,k,i:longint;
e:array[0..10]of longint;
a:array[0..50000,1..4]of longint;
procedure kp(l,r:longint);
var
i,j,mid,key1,key2:longint;
begin
if l>r then exit;
mid:=l+random(r-l+1);
key1:=a[mid,2];
key2:=a[mid,1];
i:=l;j:=r;
repeat
while (a[i,2]>key1) or (a[i,2]=key1) and (a[i,1]<key2) do inc(i);
while (a[j,2]<key1) or (a[j,2]=key1) and (a[j,1]>key2) do dec(j);
if i<=j then
begin
a[0]:=a[i]; a[i]:=a[j]; a[j]:=a[0];
inc(i); dec(j);
end;
until(i>j);
kp(l,j);
kp(i,r);
end;
begin
readln(n,k);
for i:=1 to 10 do
read(e[i]);
readln;
for i:=1 to n do
begin
read(a[i,2]);
a[i,1]:=i;
end;
kp(1,n);
for i:=1 to n do
begin
a[i,3]:=i;
a[i,4]:=(a[i,3]-1) mod 10 +1;
a[i,2]:=a[i,2]+e[a[i,4]];
end;
kp(1,n);
for i:=1 to k-1 do
write(a[i,1],' ');
if k<>0 then write(a[k,1]);
end.