Edited by author 07.02.2009 10:56

Solve it first in any language, only then ask for my solution.

Edited by author 08.02.2009 03:20

Hints:
1. Do not use many 'new' operators. I used only one int array to store data.
2. Avoid PrintWriter.printf/String.format for writing answer, it may be written using only int arithmetic.
3. Read input using StreamTokenizer or the following Scanner:

class Scanner {

   InputStream in;
   char c;

   Scanner(InputStream in) {
      this.in = in;
      nextChar();
   }

   void asserT(boolean e) {
      if (!e) {
         throw new Error();
      }
   }

   void nextChar() {
      try {
         c = (char)in.read();
      } catch (IOException e) {
         throw new Error(e);
      }
   }

   long nextLong() {
      while (true) {
         if ('0' <= c && c <= '9') {
            break;
         }
         asserT(c != -1);
         nextChar();
      }
      long value = c - '0';
      nextChar();
      while ('0' <= c && c <= '9') {
         value *= 10;
         value += c - '0';
         nextChar();
      }
      return value;
   }

   int nextInt() {
      long longValue = nextLong();
      int intValue = (int)longValue;
      asserT(intValue == longValue);
      return intValue;
   }
}

Thanks

My Java solution better from all Java solutions: 0.171 s time & 862KB memory. I use only System.in & System.out. good like.

Huh ;) 0.125 sec & 842KB memory http://acm.timus.ru/status.aspx?space=1&num=1306&author=107146

Use something like
            System.out.print( (a+b)/2 );
            if ( (a+b) % 2==0){
            } else {
                System.out.println(".5");
            }

instead of System.out.printf or String.format if you want to get AC

I cannot solve this problem.
could you tell me more hint via my email please?
here is my e-mail => holyporing@hotmail.com

i really want to do this. Thank you.

I got AC with 858KB memory

 I have tried two methods to solve this problem:

1) using PriorityQueue
2) sorting using Arrays.sort

but bumped into MLE on 7th test again and again  :(

so more hints are welcomed :)
Did you write your own heap or u are using complete different approach?

Can anyone tell me how memory 1 Mb can be exeeded if I use the PriorityQueue with size = N/2+1 and four int variables ?
How many bytes are consumed by one element of PQ ?

TIA.

how to send solution with java? in language list, i haven't got java.

Please, send your java solution on e-mail lo.de.wash.boleem@mail.ru

Edited by author 26.01.2014 19:26

Edited by author 26.01.2014 19:27