import java.util.Arrays;
import java.util.Scanner;

public class Main {
	static int n, k;
	static int[] arr;

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();// 数量
		k = sc.nextInt();// 需要的小段的数量
		arr = new int[n];
		for (int i = 0; i < arr.length; i++) {
			arr[i] = sc.nextInt();
		}
		Arrays.sort(arr);
		int l = 0;
		int r = 100000001;
		
		while (l < r) {
			int mid = l+(r-l)/2;
//			System.out.println(mid);
			if (check(mid)) {// 说明x太大 需要给mid减一下
				l = mid+1;
			} else {
				r = mid;
			}
		}
		System.out.println(r-1);
	}

	public static boolean check(int x) {
		int nums = 0;
		for (int i = 0; i < n; i++) {
			nums+=arr[i]/x;
		}
		if (nums >= k) {
			return true;
		} else {
			return false;
		}
	}

}