3935. Power Update After K-th Largest Insertion I

Keep the largest k elements separately. The answer is the smallest among them.

After inserting a value, rebalance the two sets/heaps so the “top k” side has exactly k elements. Since abs(ki - ki-1) < 10, only a few elements move each query.

Update p with fast modular exponentiation.