分巧克力（蓝桥杯17I）

#include<iostream>
using namespace std;
int main() {
	int N, K,i;
	cin >> N >> K;
	int** arr = new int*[N];
	for (i = 0; i < N; i++) {
		arr[i] = new int[3];
		cin >> arr[i][0] >> arr[i][1];
		arr[i][3] = min(arr[i][0], arr[i][1]);
		if (i != 0) {
			arr[i][3] = min(arr[i][3], arr[i - 1][3]);
		}
	}
	for (int w = arr[i - 1][3]; w > 0;w--) {
		int cnt = 0;
		for (int p = 0; p < N;p++) {
			cnt += (int(arr[p][0]/w) * (int(arr[p][1]/w)));
		}
		if (cnt >= K) {
			cout << w;
			return 0;
		}
	}
}