Please show 8 test

I try heap and sort to get AC using java, but memory usage is about 7M.
I browse the java submits, and find some top-rank solution only using about 3M memory.
e.g.
commit 9822957 by @hduads2022_20321226, 0.14 secs, 2908 KB.
commit 9290600 by @Mikhail, 0.109 secs, 1 272 KB.
how to lower the memory usage.

Show please 5 test!

Can you guys share your approach ( and proof if possible ) because mine, though AC, is not very certain. I rely on greedy approach which output pairs with maximum number and minimum number.

Use sort and find min and max after output each pair.
Quite slow, 0.14s :)

What is test 20?

I had runtime error 25, but when i surrounded sorting with try catch it accepted
Any ideas why?

2
1 10

My output is: 2 1 2 2 2 2 2 2 2 2 2

Is this corret or Did I understand task wrong..?

I've got no idea what's wrong. What's the test?

If you can't find the mistake! :)

Edited by author 28.05.2011 17:04

var
     a, b, c : array [1..10000] of integer;
     k, n, s, i, j : integer;
     toq : boolean;

    procedure quicksort;
      procedure sort(l, r : integer);
        var
          i1, j1, x, w : integer;
        begin
        i1 := l;
        j1 := r;
        x := a[(l+r) div 2];
          repeat
            while  a[i1]<x do
              inc(i1);
            while  x<a[j1] do
              dec(j1);
            if i1 <= j1 then  begin  w := a[i1]; a[i1] := a[j1];  a[j1] := w;
                                     w := b[i1]; b[i1] := b[j1];  b[j1] := w;
                                   inc(i1);  dec(j1);     end;
          until i1 > j1;
        if l < j1 then sort(l, j1);
        if i1 < r then sort(i1, r);
        end;
     begin
     sort(1, n);
     end;{quicksort}

begin
  read(n);
  for k := 1 to n do
    begin
      read(a[k]);
      b[k] := k;
    end;
    s := 0;
    for k := 1 to n do
    s := s + a[k];

  quicksort;
  toq := true;
  for k := 1 to n do
    begin
      if toq then
        begin
          j := 1;  i := 1;
          while (i <= s) and (j <= a[k]) do
            begin
            c[i] := b[k];
            inc(i, 2);
            inc(j);
            end;
          if i > s then toq := false;
        end;
      if toq = false then
        begin
          j := 1;  i := 2;
          while (i <= s) and (j <= a[k]) do
            begin
            c[i] := b[k];
            inc(i, 2);
            inc(j);
            end;
        end;
     end;

     for i := 1 to s do
     write(c[i], ' ');
end.
or smth wrong with my idea!!!

My AC solution for test

3
1 3 1

answers

2 1 2 2 3

while better answer is

2 1 2 3 2

program Project2;

{$APPTYPE CONSOLE}

uses
  SysUtils;
  var
     a,b:array[1..10001] of integer;
     t,i,n,t1,t2,j:longint;
begin
 { assign(input,'d:\input.txt'); reset(input);
   assign(output,'d:\output.txt'); rewrite(output);}
    readln(n);
    if n=1 then begin write(1); exit; end;
    for i:=1 to n do
        begin
           read(a[i]);
           b[i]:=i;
        end;
    for i:=1 to n-1 do
      for j:=i+1 to n do
      if a[i]<a[j] then
         begin
            a[i]:=a[i]+a[j];
            a[j]:=a[i]-a[j];
            a[i]:=a[i]-a[j];
            b[i]:=b[i]+b[j];
            b[j]:=b[i]-b[j];
            b[i]:=b[i]-b[j];
         end;
     t:=-1; a[n+1]:=-1;
     repeat
     if (t<>b[1]) and (a[1]<>0) then
       begin
        t:=b[1];
        a[1]:=a[1]-1;
       end
     else
     if (t<>b[2]) and (a[2]<>0) then
       begin
        t:=b[2];
        a[2]:=a[2]-1;
       end;
     i:=1;
     while a[i]<a[i+1] do
        begin
            j:=i+1;
            a[i]:=a[i]+a[j];
            a[j]:=a[i]-a[j];
            a[i]:=a[i]-a[j];
            b[i]:=b[i]+b[j];
            b[j]:=b[i]-b[j];
            b[i]:=b[i]-b[j];
            i:=i+1;
         end;
     i:=2;
     while a[i]<a[i+1] do
        begin
            j:=i+1;
            a[i]:=a[i]+a[j];
            a[j]:=a[i]-a[j];
            a[i]:=a[i]-a[j];
            b[i]:=b[i]+b[j];
            b[j]:=b[i]-b[j];
            b[i]:=b[i]-b[j];
            i:=i+1;
         end;
     write(t,' ');
     until (a[2]=0);
     if t<>b[1] then write(b[1]);
{     sleep(112121);}
{   close(input);
   close(output); }
end.

give me wrong test, please!