#include<iostream>//二分查找
#include<vector>
#include<queue>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef unsigned long long ll;
const int MAXN = 100005;
int cholo[MAXN][2];
int main()
{
int n, k,ans=0;
cin >> n >> k;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < 2; j++)
{
cin >> cholo[i][j];
}
}
int l = 1, r = 100000;
while (l <= r)
{
int sum = 0;
int mid = (r + l) / 2;
for (int i = 0; i < n; i++)
{
sum += ((cholo[i][0] / mid) * (cholo[i][1] / mid));
}
if (sum >= k)
{
if (mid > ans)
{
ans = mid;
}
l = mid + 1;
}
if(sum<k)
{
r = mid - 1;
}
}
cout << ans << endl;
return 0;
}
0.0分
2 人评分
C二级辅导-同因查找 (C语言代码)浏览:554 |
母牛的故事 (C语言代码)浏览:737 |
C语言训练-列出最简真分数序列* (C语言代码)浏览:500 |
兰顿蚂蚁 (C++代码)浏览:1091 |
【蟠桃记】 (C语言代码)浏览:664 |
WU-printf基础练习2 (C++代码)浏览:2000 |
Wu-求圆的面积 (C++代码)浏览:1883 |
C语言程序设计教程(第三版)课后习题6.2 (C语言代码)浏览:703 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:460 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:398 |