Operations Research, Machine Learning, Linear Optimization, Optimization, Dynamic Programming.
Problem, we see that the additional constraints on the exact number of players and the minimum number of player types in the team makes this NP-Hard. On the contrary if we take a Greedy approach i.e. select the players with the highest values, then there is no guarantee that total price for the 11