The sum of square roots problem

Bound how close two sums of k square roots of integers up to n can be, and decide whether such sums can be compared in polynomial time.