ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1100. Final Standings

[SESC USU]Rudnev Vladimir what's wrong??? [6] // Problem 1100. Final Standings 15 Nov 2010 21:25
I think, i do all rigth, but i've WA1=((
I don't understand output type, that's mean what me should to print. Sorry for my English...

var a,b:array[1..15000]of longint; asd,asd1,n,i,j:longint;
begin
read(n);
for i:=1 to n do read(a[i],b[i]);

for i:=1 to n-1 do
  for j:=i+1 to n do
    if b[i]<b[j] then begin
                      asd:=b[i];
                      b[i]:=b[j];
                      b[j]:=asd;
                      asd1:=a[i];
                      a[i]:=a[j];
                      a[j]:=asd1;
                      end;

for i:=1 to n do begin write(a[i],' ',b[i]);writeln;end;
end.
[SESC USU]Rudnev Vladimir Re: what's wrong??? // Problem 1100. Final Standings 15 Nov 2010 21:41
Ou fuck, i've do sort dont rigth....
[SESC USU]Rudnev Vladimir Re: what's wrong??? [4] // Problem 1100. Final Standings 15 Nov 2010 21:41
Ou fuck, i've do sort dont rigth....
Avitella Re: what's wrong??? [3] // Problem 1100. Final Standings 10 Jun 2012 01:06
I think your solution will be TL. Use merge, or another fast sort
Andrew Sboev Re: what's wrong??? [2] // Problem 1100. Final Standings 10 Jun 2012 20:49
I think that you answered two years later than it was necessary :)
IlushaMax Re: what's wrong??? [1] // Problem 1100. Final Standings 13 Mar 2016 02:54
)
Escarabajo Re: what's wrong??? // Problem 1100. Final Standings 26 Mar 2017 12:39
And now?