Can someone give me a hint on this problem and also can one friend take more than one gift because it is not clear in the statement.
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 153 |
| 2 | nik_exists | 151 |
| 3 | maroonrk | 150 |
| 4 | maspy | 149 |
| 5 | AmShZ | 146 |
| 6 | Um_nik | 143 |
| 7 | Errichto | 139 |
| 8 | adamant | 135 |
| 9 | BledDest | 134 |
| 10 | cry | 130 |
Can someone give me a hint on this problem and also can one friend take more than one gift because it is not clear in the statement.
| Name |
|---|



You buy exactly one gift for every friend. So in total you buy exactly m gifts. The question is in how many different ways you can choose m out of n gifts. With the extra constraint that at least k of them have a price of at least d.
Divide the n gifts into two groups. One expensive group where every gift has a price of at least d. And one cheap group with all the other gifts.
How many ways there are to choose k gifts out of the expensive gifts and m-k out of the cheap gifts? How many ways to choose k+1 expensive gifts and m-k-1 out of the cheap gifts? ...