OJ Board

here some test cases:


........
...k....
....P...
........
........
........
.....K..
........

........
...k....
..P.....
........
........
........
.....K..
........

........
...k....
........
........
........
...R....
.....K..
........

........
...k..R ...

several of ur test-cases are illegal. on each board there are 2 kings!

greeez

got it. but it must not be such a complicated code including quicksort and stuff. also simple arrays will do the job efficiently. just compute the minimum of the summed differences of the values over/less the avg.

keep ur code as simple as possible, but not simpler.

regards

The correct outputs for the inputs:


3
10.00
20.00
30.00
4
15.00
15.01
3.00
3.01
3
6.17
5.00
4.03
12
123.12
6.13
9.44
89.08
278.78
223.78
78.45
912.89
554.76
547.57
1781.89
907.07
2
4.99
15.00
1
10.00
15
0.01
0.01
0.01
0.01
0.01
0.01
0.01
0.01
0.01
0.01
0.01
0.01
0.01
0.01
0.03
5
5000.00
11.11
11 ...