Hi I have a hard time solving the following problem:
You are given n-element increasing sequence. You don't know the exact values $$$a_1, a_2, ..., a_n$$$, but you can ask about them. Question about element $$$a_i$$$ costs $$$c_i$$$. Find out how many elements in the sequence are greater than $$$k$$$ with the lowest cost(where cost is the sum of costs of all asked question).
I'd be really grateful for a solution or a hint on how to solve this. Thank you.