A14841 | Set or Decrease
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given an integer array $a_1, a_2, \dots, a_n$ and integer $k$ .
In one step you can
- either choose some index $i$ and decrease $a_i$ by one (make $a_i = a_i - 1$ );
- or choose two indices $i$ and $j$ and set $a_i$ equal to $a_j$ (make $a_i = a_j$ ).
What is the minimum number of steps you need to make the sum of array $\sum\limits_{i=1}^{n}{a_i} \le k$ ? (You are allowed to make values of array negative).
In one step you can
- either choose some index $i$ and decrease $a_i$ by one (make $a_i = a_i - 1$ );
- or choose two indices $i$ and $j$ and set $a_i$ equal to $a_j$ (make $a_i = a_j$ ).
What is the minimum number of steps you need to make the sum of array $\sum\limits_{i=1}^{n}{a_i} \le k$ ? (You are allowed to make values of array negative).
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases.
The first line of each test case contains two integers $n$ and $k$ ( $1 \le n \le 2 \cdot 10^5$ ; $1 \le k \le 10^{15}$ ) — the size of array $a$ and upper bound on its sum.
The second line of each test case contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 10^9$ ) — the array itself.
It's guaranteed that the sum of $n$ over all test cases doesn't exceed $2 \cdot 10^5$ .
The first line of each test case contains two integers $n$ and $k$ ( $1 \le n \le 2 \cdot 10^5$ ; $1 \le k \le 10^{15}$ ) — the size of array $a$ and upper bound on its sum.
The second line of each test case contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 10^9$ ) — the array itself.
It's guaranteed that the sum of $n$ over all test cases doesn't exceed $2 \cdot 10^5$ .
输出格式
For each test case, print one integer — the minimum number of steps to make $\sum\limits_{i=1}^{n}{a_i} \le k$ .
输入输出样例
输入 #1
4 1 10 20 2 69 6 9 7 8 1 2 1 3 1 2 1 10 1 1 2 3 1 2 6 1 6 8 10
输出 #1
10 0 2 7
In the first test case, you should decrease $a_1$ $10$ times to get the sum lower or equal to $k = 10$ .
In the second test case, the sum of array $a$ is already less or equal to $69$ , so you don't need to change it.
In the third test case, you can, for example:
1. set $a_4 = a_3 = 1$ ;
2. decrease $a_4$ by one, and get $a_4 = 0$ .
As a result, you'll get array $[1, 2, 1, 0, 1, 2, 1]$ with sum less or equal to $8$ in $1 + 1 = 2$ steps.In the fourth test case, you can, for example:
1. choose $a_7$ and decrease in by one $3$ times; you'll get $a_7 = -2$ ;
2. choose $4$ elements $a_6$ , $a_8$ , $a_9$ and $a_{10}$ and them equal to $a_7 = -2$ .
As a result, you'll get array $[1, 2, 3, 1, 2, -2, -2, -2, -2, -2]$ with sum less or equal to $1$ in $3 + 4 = 7$ steps.
In the second test case, the sum of array $a$ is already less or equal to $69$ , so you don't need to change it.
In the third test case, you can, for example:
1. set $a_4 = a_3 = 1$ ;
2. decrease $a_4$ by one, and get $a_4 = 0$ .
As a result, you'll get array $[1, 2, 1, 0, 1, 2, 1]$ with sum less or equal to $8$ in $1 + 1 = 2$ steps.In the fourth test case, you can, for example:
1. choose $a_7$ and decrease in by one $3$ times; you'll get $a_7 = -2$ ;
2. choose $4$ elements $a_6$ , $a_8$ , $a_9$ and $a_{10}$ and them equal to $a_7 = -2$ .
As a result, you'll get array $[1, 2, 3, 1, 2, -2, -2, -2, -2, -2]$ with sum less or equal to $1$ in $3 + 4 = 7$ steps.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted