demo click to expand
Click to expand!
- sort bidder reversed by bid: i.e P1 has biggest budget; P(N) have smallest budget
- P(i) with i > K bid for
item[k]
- P(i) with i <= K bid for the item[i], with price
1+budget[i+1]
if player i-th exists
MIN_BID
if player (i+1)-th exists