import heapq
import random
x = range(100000)
random.shuffle(x)
print(heapq.nlargest(2, x))
Gives: [99999, 99998]
Now just do something like:
max_column = heapq.nlargest(len(x)/2, x)
That should give you half of your list in a "large" pile, and do the same for the small pile.