代码如下：
一直TLE 0
#include<bits/stdc++.h>
using namespace std;
int minO(vector<int>& nums, int k) {
int n = nums.size();
int sum = 0;
for (int i = 0; i < n; i++) {
sum += nums[i];
}
if (sum <= k) {
return 0;
}
int o = 0;
sort(nums.begin(), nums.end());
for (int i = n-1; i >= 0; i--) {
if (sum <= k) {
break;
}
if (i > 0 && nums[i] > nums[i-1]) {
int diff = nums[i] - nums[i-1];
int times = min((sum - k + diff - 1) / diff, i);
sum -= diff * times;
o += times;
}
}
return o;
}
int main() {
int T;
cin >> T;
while (T--) {
int n, k;
cin >> n >> k;
vector<int> nums(n);
for (int i = 0; i < n; i++) {
cin >> nums[i];
}
cout << minO(nums, k) << endl;
}
return 0;
}