assert (x >= 0);
assert (x < M());
}
assert i == num_fractional : "i=" + i + " num_fractional="
+ num_fractional;
Comparator<Integer> c = new ArrayIndexComparator(r_frac);
Arrays.sort(rlist, c);
/*
* We now have budget - sofar to give. Allocate them to the entries
* with the largest fractional part. The sort has put them in