fDDqhw - Online C++0x Compiler & Debugging Tool

#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl
inline int power(int a, int b) {
    int x = 1;
    while (b) {
        if (b & 1) x *= a;
        a *= a;
        b >>= 1;
    }
    return x;
}


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

//_ ***************************** START Below *******************************

vector<int> a;

bool isPossible(int n, int k, int mid){
	int ct = 0;
	for(int i=0; i<n; i++){
		ct += (a[i] + mid - 1) / mid;
	}

	return ct <= k;
}

void consistency(int n, int k){

	int s = 1, e = INF;
	while(s<e){
		int mid = s + (e-s)/2;
		if(isPossible(n, k, mid)){
			e = mid;
		}
		else s = mid+1;
	}

	cout << e << endl;

}

void solve() {

    int n, k;
    cin>>n >> k;

    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];

    consistency(n, k);


}


int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}