Java(javac 1.8) 解法, 执行用时: 372ms, 内存消耗: 55000K, 提交时间: 2020-12-21 15:33:09

import java.util.*;
public class Main {
	static long a[];
	static int n;
	static int m;
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		m = sc.nextInt();
		a = new long[n];
		for (int i = 0; i < n; i++) {
			a[i] = sc.nextLong();
		}
		long l = 0, r = 1000000009,mid;
		while (l<r-1) {
			mid = (l+r)>>1;
			if(check(mid))
				l = mid;
			else {
				r = mid - 1;
			}
		}
		if (check(l+1)) {
			l++;
		}
		System.out.println(l);
	}
	public static boolean check(long x) {
		int ans = 0;
		for (int i = 0; i < n; i++) {
			ans += (a[i]/x);
		}
		return ans>=m?true:false;
	}
}

C++(clang++11) 解法, 执行用时: 22ms, 内存消耗: 744K, 提交时间: 2020-12-20 15:04:19

#include <bits/stdc++.h>
using namespace std;

int n,k;
long num[200005];
long maxs = 0;

bool chek(long mid)
{
	long ans = 0;
	for(int i=0;i<n;i++)
		ans+=num[i]/mid;
	if(ans>=k)
		return true;
	else
		return false;
}

int main()
{
	cin>>n>>k;
	for(int i=0;i<n;i++)
		cin>>num[i];
	long l = 1,r = 1000000000;
	long mid;
	while(l<r)
	{
		mid = (l+r)/2;
		if(chek(mid))
		{
			maxs = max(maxs,mid);
			l = mid+1;
		}
		else
		{
			r = mid-1;
		}
	}
	cout<<maxs<<endl;
	return 0;
}