noi4_6_3528[最小新整数]
经典的贪心,每次去掉第一个递增序列最后一个数字,(少了一个等号查了20min错TAT)
var s:ansistring; i,j,k,n,m,hh:longint;
begin
readln(n);
for j:=1 to n do
begin
readln(s);
hh:=pos(' ',s);
val(copy(s,hh+1,length(s)-hh),m);
s:=copy(s,1,hh-1);
for i:=1 to m do
begin
k:=1;
while (k<length(s))and(s[k]<=s[k+1]) do inc(k);
delete(s,k,1);
while s[1]='0' do delete(s,k,1);
end;
if s='' then writeln(0) else writeln(s); end;
end .