CF1614A.Divan and a Store

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Businessman Divan loves chocolate! Today he came to a store to buy some chocolate. Like all businessmen, Divan knows the value of money, so he will not buy too expensive chocolate. At the same time, too cheap chocolate tastes bad, so he will not buy it as well.

The store he came to has nn different chocolate bars, and the price of the ii -th chocolate bar is aia_i dollars. Divan considers a chocolate bar too expensive if it costs strictly more than rr dollars. Similarly, he considers a bar of chocolate to be too cheap if it costs strictly less than ll dollars. Divan will not buy too cheap or too expensive bars.

Divan is not going to spend all his money on chocolate bars, so he will spend at most kk dollars on chocolates.

Please determine the maximum number of chocolate bars Divan can buy.

输入格式

Each test contains multiple test cases. The first line contains the number of test cases tt ( 1t1001 \le t \le 100 ). Description of the test cases follows.

The description of each test case consists of two lines. The first line contains integers nn , ll , rr , kk ( 1n1001 \le n \le 100 , 1lr1091 \le l \le r \le 10^9 , 1k1091 \le k \le 10^9 ) — the lowest acceptable price of a chocolate, the highest acceptable price of a chocolate and Divan's total budget, respectively.

The second line contains a sequence a1,a2,,ana_1, a_2, \ldots, a_n ( 1ai1091 \le a_i \le 10^9 ) integers — the prices of chocolate bars in the store.

输出格式

For each test case print a single integer — the maximum number of chocolate bars Divan can buy.

输入输出样例

  • 输入#1

    8
    3 1 100 100
    50 100 50
    6 3 5 10
    1 2 3 4 5 6
    6 3 5 21
    1 2 3 4 5 6
    10 50 69 100
    20 30 40 77 1 1 12 4 70 10000
    3 50 80 30
    20 60 70
    10 2 7 100
    2 2 2 2 2 7 7 7 7 7
    4 1000000000 1000000000 1000000000
    1000000000 1000000000 1000000000 1000000000
    1 1 1 1
    1

    输出#1

    2
    2
    3
    0
    0
    10
    1
    1

说明/提示

In the first example Divan can buy chocolate bars 11 and 33 and spend 100100 dollars on them.

In the second example Divan can buy chocolate bars 33 and 44 and spend 77 dollars on them.

In the third example Divan can buy chocolate bars 33 , 44 , and 55 for 1212 dollars.

In the fourth example Divan cannot buy any chocolate bar because each of them is either too cheap or too expensive.

In the fifth example Divan cannot buy any chocolate bar because he considers the first bar too cheap, and has no budget for the second or third.

In the sixth example Divan can buy all the chocolate bars in the shop.

首页