Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- int compare(const void *a, const void *b) {
- if ((*(long int*)a - *(long int*)b) < 0)
- return -1;
- if ((*(long int*)a - *(long int*)b) > 0)
- return 1;
- return 0;
- }
- int main() {
- int t,n,m; long int M[7] = {0}; scanf("%d",&t);
- while(t--) {
- int step=0; scanf("%d %d",&n,&m);
- for(int i=0;i<n;i++) scanf("%ld", &M[i]);
- qsort(M, n, sizeof(long int), compare);
- for(int i=n-1;i>=0;i--) {
- m = m - M[i]; step++;
- if(m <= 0) break;
- }
- if (m>0) printf("-1\n"); else printf("%d\n",step);
- }
- }
Add Comment
Please, Sign In to add comment