Educational Codeforces Round 1303D #82 (Rated for Div. 2) D. Fill The Bag 解题思路 － 思维题&二进制

Educational Codeforces Round 1303D #82 (Rated for Div. 2) D. Fill The Bag

You have a bag of size 𝑛. Also you have 𝑚 boxes. The size of 𝑖-th box is 𝑎𝑖, where each 𝑎𝑖 is an integer non-negative power of two.

You can divide boxes into two parts of equal size. Your goal is to fill the bag completely.

For example, if 𝑛=10 and 𝑎=[1,1,32] then you have to divide the box of size 32 into two parts of size 16, and then divide the box of size 16. So you can fill the bag with boxes of size 1, 1 and 8.

Calculate the minimum number of divisions required to fill the bag of size 𝑛.

Input

The first line contains one integer 𝑡 (1≤𝑡≤1000) — the number of test cases.

The first line of each test case contains two integers 𝑛 and 𝑚 (1≤𝑛≤10¹⁸,1≤𝑚≤10⁵) — the size of bag and the number of boxes, respectively.

The second line of each test case contains 𝑚 integers 𝑎₁,𝑎₂,…,𝑎_𝑚 (1≤𝑎_𝑖≤10⁹) — the sizes of boxes. It is guaranteed that each 𝑎𝑖is a power of two.

It is also guaranteed that sum of all 𝑚 over all test cases does not exceed 10⁵.

Output

For each test case print one integer — the minimum number of divisions required to fill the bag of size 𝑛 (or −1, if it is impossible).

Example

input

3
10 3
1 32 1
23 4
16 1 4 1
20 5
2 1 16 1 8

output

2
-1
0

有总大小为n的物品，需要放进m个大小为ai的盒子中(1<=i<=m)。每个盒子的大小是2的整数次幂，一个盒子可以转换成两个它的盒子一半大小的盒子。求这样的转换最少多少次，可以装满所需的盒子的所有容量。

/// @author zhaolu

#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <sstream>
#include <algorithm>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define repe(i,a,b) for(int i=a;i<=b;++i)
#define per(i,a,b) for(int i=a;i>=b;--i)
#define clc(a,b) memset(a,b,sizeof(a))
#define INF (0x3f3f3f3f)
#define MOD (1000000007)
#define MAX (100)
#define LEN (MAX+10)
typedef long long ll;
using namespace std;

int t;
long long n;
int m,tmp,ans;
int a[LEN];
map<ll,int> maps;
int main()
{
    scanf("%d",&t);
    ll j=1;
    rep(i,0,63)
    {
        maps[j]=i;
        j<<=1;
    }
    while(t--)
    {
        scanf("%lld%d",&n,&m);
        memset(a,0,sizeof(a));
        while(m--)
        {
            scanf("%d",&tmp);
            ++a[maps[tmp]];
        }
        ans=0;
        ll i=1;
        int j=0;
        while(n)
        {
            if(n&i)
            {
                if(a[j]) --a[j];
                else 
                {
                    int k=j+1;
                    for(;k<63;++k){
                        ++ans;
                        if(a[k]){
                            --a[k];
                            break;
                        }
                    }
                    if(k==63) break;
                    rep(jj,j,k) ++a[jj];
                }
                n-=i;
            }
            a[j+1]+=a[j]/2;
            i<<=1;
            ++j;
        }
        if(n==0) printf("%d\n",ans);
        else printf("-1\n");
    }
    return 0;
}