my solution is corret and fast Ithink  but it is not enough.why in 12th I have TIme limit


Edited by author 27.01.2006 23:01

iI also had this problem.
Do not use too many unnecessary operations like sorting.
Beginning from largest possible score. choose all teams with this score.
and you have written TKTL. are you from turkish school?

Edited by author 28.01.2006 15:39

I get AC
use program of Bourne but instead of smallint use byte;
var
n,i,j,x:longint;
a:array[0..150000] of byte;
b:array[0..150000] of longint;
begin

readln(n);
for i:=1 to n do
begin
readln(b[i],a[i]);
end;

for x:=100 downto 0 do
begin
for i:=1 to n do
if a[i]=x then writeln(b[i],' ',a[i]);
end;

end.

Edited by author 28.01.2006 15:57

yes and you

yes and me.

thanks but
who  you are??????

N=150000