二分典型题

最新推荐文章于 2020-08-19 20:56:42 发布

PrConstantin

最新推荐文章于 2020-08-19 20:56:42 发布

阅读量459

点赞数 1

分类专栏：二分

本文链接：https://blog.csdn.net/why850901938/article/details/51213786

版权

二分专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Description
Bizon the Champion isn’t just charming, he also is very smart.

While some of us were learning the multiplication table, Bizon the Champion had fun in his own manner. Bizon the Champion painted an n × m multiplication table, where the element on the intersection of the i-th row and j-th column equals i·j (the rows and columns of the table are numbered starting from 1). Then he was asked: what number in the table is the k-th largest number? Bizon the Champion always answered correctly and immediately. Can you repeat his success?

Consider the given multiplication table. If you write out all n·m numbers from the table in the non-decreasing order, then the k-th number you write out is called the k-th largest number.

Input
The single line contains integers n, m and k(1 ≤ n, m ≤ 5·105; 1 ≤ k ≤ n·m).

Output
Print the k-th largest number in a n × m multiplication table.

Sample Input
Input
2 2 2
Output
2
Input
2 3 4
Output
3
Input
1 10 5
Output
5
Hint
A 2 × 3 multiplication table looks like this:

1 2 3
2 4 6


#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
    long long n, m, k, left, right, mid, sum=0, res;
    scanf("%I64d%I64d%I64d", &n, &m, &k);
    left=1; right=n*m;
    while(left<=right)
    {
        sum=0;
        mid=(left+right)/2;
        for(int i=1;i<=n;i++)
            sum+=min((mid-1)/i,m);
        if(sum<k)
        {
            left=mid+1;
            res=mid;
        }
        else
            right=mid-1;
    }
    printf("%I64d", res);
    return 0;
}