Question: c++ language There are n programmers that you want to split into several non-empty teams. The skill of the i-th programmer is di. You want


There are n programmers that you want to split into several non-empty teams. The skill of the i-th programmer is di. You want to assemble the maximum number of teams from them. There is a restriction for each team: the number of programmers in the team multiplied by the minimum skill among all programmers in the team must be at least x. Each programmer should belong to at most one team. Some programmers may be left without a team. Calculate the maximum number of teams that you can assemble. Input The first line contains the integer ( 1313 1000) - the number of test cases. The first line of each test case contains two integers n and x ( 13n10:1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
