You are given an inventory of colored balls, each with a value equal to its count. Determine the maximum total value you can obtain by selling a limited number of these balls, given that each sale reduces the ball's value by one.

Imagine people in a circle, eliminating every kth person. Determine who is the last person remaining after this process.

Design a data structure that supports insertion, deletion, and random element retrieval, all in constant time on average. You'll need to handle edge cases carefully to achieve O(1) complexity.