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.
The single line contains integers n, m and k (1 ≤ n, m ≤ 5·105; 1 ≤ k ≤ n·m).
Print the k-th largest number in a n × m multiplication table.
2 2 2
2
2 3 4
3
1 10 5
5
A 2 × 3 multiplication table looks like this:
1 2 3 2 4 6
题目意思 :
给你一个矩阵 这个矩阵中的元素是行列之积 然后再给你一个k 让你求这个矩阵中元素的第k小的值是什么
思路:
提供一个二分的写法是这样的 我们可以二分答案 二分的范围是1-n*m 然后去找 符合条件的值 二分找一个矩阵中小于等于当前数字的数字有多少个就好了
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
long long k;
long long n , m ;
bool judge(long long x)
{
long long res = 0;
for (long long i = 1; i <= n; i ++) {
res += min( x / i , m);
if(res >= k)return true;
}
return false;
}
int main()
{
while (cin >> n >> m >> k) {
long long res = n * m;
long long i , j ;
i = 1; j = res;
while (i < j) {
long long mid = (j + i) >> 1;
if(judge(mid))
j = mid;
else i = mid + 1;
}
cout << j << endl;
}
}