1069 Pascal Accepted 0.906
I use O(N^2)

There is O(n*log(n)) algorithm for this problem (use heap).

呵呵。我现在用了线段树，就成这样了：
1069 Pascal Accepted 0.062 789 КБ