A new problem from Jivko Ganev appeared.
The memory limit is 1 200 000 bytes instead of 1 000 000,
as ususal.

I think everyone understands that this problem isn't really
solved by me , I was just testing Jivko's solution and fine-
tuning time and memory limits.

I wanna say that I am sorry that the memory limit is so
tight, on my machine I use only 700k which is about 300k
under the limit, and I see that delphi adds a lot of stuff
so from 700k the memory consumed grows to 1190k, and there
is only 10k slack space.

well my time is: 0.13
and my memory is: 110K

who of you guys better? :-)))

Ok, I realize that my test cases are weak. I have seen
Petko Minkov's solution, and it is very cool greedy that
works in 95% cases. I think of even using it to get
approximate solution on bigger graphs like 5000 or more
verts, because my solution is both memory and speed
constrained.

I will also try to make some new test cases that are harder.