QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#241402 | #3025. Assimilation | climaxcx | AC ✓ | 691ms | 22236kb | C++14 | 909b | 2023-11-06 05:32:57 | 2023-11-06 05:32:58 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
bool check(int n, long long mob, multiset<long long>S, long long k){
for(int i = 0; i < mob; i++){
auto it = S.upper_bound(k);
it--;
if(*it == -1)return false;
k += *it;
S.erase(it);
}
for(int i = 0; i < n - mob; i++){
auto it = S.upper_bound(k);
it--;
if(*it == -1)return false;
k -= *it;
S.erase(it);
}
return true;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int z;
cin >> z;
while(z--){
int n;
long long k;
cin >> n >> k;
multiset<long long>S;
for(int i = 0; i < n; i++){
int x;
cin >> x;
S.insert(x);
}
S.insert(-1);
int l = 0, r = n;
while(l <= r){
long long mid = l + (r-l)/2;
if(check(n, mid, S, k))r = mid - 1;
else l = mid + 1;
}
if(l == n + 1)cout << "-1\n";
else cout << l << '\n';
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 691ms
memory: 22144kb
input:
29 9 1 1 1 2 1 1 1 1 1 1 4 1 3 2 1 1 5 316660370 269357435 105688553 346785866 295093544 181703417 6 43402885 39947441 27068237 43810814 44913378 40095941 34779892 22 319594 3815194 3056481 6593888 7315914 6593888 4794774 2561877 5256242 4920603 5256242 3606645 864746 1594265 1235578 2361430 2277526...
output:
4 2 2 3 -1 10621 4 -1 7 5385 8 2 -1 5 6264 3 0 -1 124764 5 -1 7 10940 1 3 100000 5 -1 -1
result:
ok 29 lines
Test #2:
score: 0
Accepted
time: 642ms
memory: 22236kb
input:
30 1537 2 5 6 3 3 6 5 3 5 5 5 6 5 5 6 4 6 6 6 4 3 5 5 5 6 4 6 2 3 4 5 5 5 5 5 6 6 6 4 4 4 2 6 6 5 3 6 5 6 6 5 6 5 4 3 5 6 4 3 5 3 6 4 5 6 4 1 4 6 4 5 2 4 3 4 6 6 5 5 5 6 6 5 5 5 6 4 5 6 6 6 5 5 5 3 3 2 4 6 3 5 4 4 6 6 6 5 5 6 4 4 6 6 6 6 4 6 6 3 4 5 5 3 4 5 4 6 5 5 6 5 6 6 3 3 6 5 4 6 4 6 6 4 5 3 2 ...
output:
629 22 1452 10 2121 5094 6 1135 7123 2140 4 916 1802 1237 5 6 1498 262 115823 1223 11 1032 844 13 1899 4 1212 17 -1 1797
result:
ok 30 lines
Test #3:
score: 0
Accepted
time: 681ms
memory: 19088kb
input:
30 11 40454552 9677001 192936684 252254034 192936684 37357273 9156546 74500194 116624778 13650360 2174119 13650360 27 1 3 2 3 1 3 5 3 5 1 1 1 1 1 1 4 4 1 1 1 2 1 3 3 1 3 2 4 11 72578887 172937772 206562668 87600829 84557056 103901588 148396091 92438037 215698807 125600579 216304481 191851963 5 1 1 2...
output:
4 9 -1 3 19 -1 5 9 4 4 18 14 5 5 83242 7 4 -1 6 22 5 3 17 -1 2 7 22 158159 -1 12
result:
ok 30 lines