codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1380C.md (1394B)


      1 Source: https://codeforces.com/problemset/problem/1380/C
      2 
      3 C. Create The Teams
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 There are $n$ programmers that you want to split into several non-empty teams. The skill of the $i$-th programmer is $a_i$. 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$.
     22 
     23 Each programmer should belong to at most one team. Some programmers may be left without a team.
     24 
     25 Calculate the maximum number of teams that you can assemble.
     26 
     27 Input
     28 
     29 The first line contains the integer $t$ ($1 \le t \le 1000$) — the number of test cases.
     30 
     31 The first line of each test case contains two integers $n$ and $x$ ($1 \le n \le 10^5; 1 \le x \le 10^9$) — the number of programmers and the restriction of team skill respectively.
     32 
     33 The second line of each test case contains $n$ integers $a_1, a_2, \dots , a_n$ ($1 \le a_i \le 10^9$), where $a_i$ is the skill of the $i$-th programmer.
     34 
     35 The sum of $n$ over all inputs does not exceed $10^5$.
     36 
     37 Output
     38 
     39 For each test case print one integer — the maximum number of teams that you can assemble.
     40 
     41 Example
     42 
     43 Input
     44 
     45 ```
     46 3
     47 5 10
     48 7 11 2 9 5
     49 4 8
     50 2 4 2 3
     51 4 11
     52 1 3 3 7
     53 ```
     54 
     55 Output
     56 
     57 ```
     58 2
     59 1
     60 0
     61 ```