I too did not know what was wrong with my solution, but got accepted when replaced:

for (int i = n; i >= 1; i--)
    if (time[i] < time[besti]) besti = i;

with:

for (int i = n; i >= 1; i--)
    if (time[i] + epsilon < time[besti]) besti = i;

With epsilon = 1e-9.
Good luck! :)

Thank you very much. You really helped me: I did the same thing and got AC.

for wa7 too work.. thx

Edited by author 11.08.2014 17:44