3967. Ropes

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define mp make_pair
#define pb push_back

int n,k;
vector<int> v;

bool F(int t)
{
    int tmp = 0;
    for(int i=0;i<n;i++)
    {
        tmp += v[i]/t;
    }
    return tmp >= k;
}

signed main() {
    ios::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);

    cin >> n >> k;

    v.resize(n);

    for(int i=0;i<n;i++)
    {
        cin >> v[i];
    }

    int L = 0, R = (int)1e9;

    int mid;

    while(R - L > 1)
    {
        mid = (L+R)/2;
        if(F(mid))
            L = mid;
        else
            R = mid;
    }

    cout << (F(R) ? R : L);

    return 0;
}