Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- using lli = long long;
- void Solve(){
- int n, k;
- scanf("%d%d", &n, &k);
- int ar[k + 1];
- for(int i=1;i<=k;i++)
- scanf("%d", &ar[i]);
- sort(ar + 1, ar + k + 1);
- int cnt = 0;
- lli dis = 0;
- for(int i=k;i>=1;i--){
- if((lli) ar[i] > dis) cnt ++;
- dis += (lli)(n - ar[i]);
- }
- printf("%d\n", cnt);
- }
- int main(){
- int Q;
- scanf("%d", &Q);
- while(Q --){
- Solve();
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement