J. The Parade

http://codeforces.com/contest/1250/problem/J

#include <bits/stdc++.h>
//#include <queue>
//#include <cmath>
//#include <iostream>
//#include <unordered_map>

#define lson rt<<1
#define rson rt<<1|1
#define lowbit(x) ((x)&(-x))
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define INF 0x3f3f3f3f
#define ll long long
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

const int mod=1e9+7;
const int N=5e5+9;

ll n,k;
ll c[N];

bool ch(ll mid)
{
    ll ans=0;
    ll yu=0;
    for(int i=1;i<=n;i++)
    {
        if(c[i]+yu<mid)
        {
            yu=0;
        }
        ans+=(c[i]+yu)/mid;
        yu=(c[i]+yu)%mid;
        if(ans>=k) return 1;
    }
    return ans>=k;
}

int main()
{
    FAST_IO;

    int T;
    cin>>T;
    while(T--)
    {

        cin>>n>>k;
        for(int i=1;i<=n;i++) cin>>c[i];

        ll l=1,r=1e17;//l不能为0！！

        ll ans=0;
        while(l<=r)
        {
            ll mid=(l+r)>>1;
            if(ch(mid))
            {
                ans=mid;
                l=mid+1;
            }
            else r=mid-1;
        }

        cout<<ans*k<<endl;

    }

    return 0;
}