# 基础二分模板
leetcode34. 在排序数组中查找元素的第一个和最后一个位置
class Solution {
int n;
public:
int lower_bound(vector<int>& w, int target){
int l = -1, r = n;//开区间二分写法
while(l + 1 < r){
int mid = l + r >> 1;
if(w[mid] < target) l = mid;//false
else r = mid;//true
}
return r;
}
vector<int> searchRange(vector<int>& w, int target) {
n = w.size();
int st = lower_bound(w, target);
if(st == n || w[st] != target) return {-1, -1};
int ed = lower_bound(w, target + 1) - 1;
return {st, ed};
}
};
class Solution {
public:
int findPeakElement(vector<int>& w) {
//leetcode官方题解说的挺好,结合灵茶山艾府的模板
//false代表目标峰顶左侧,true代表目标峰顶及目标峰顶右侧
//w[n - 1]已经为true
int l = -1, r = w.size() - 1;//二分开区间写法
while(l + 1 < r){
int mid = l + r >> 1;
if(w[mid] < w[mid + 1]) l = mid;
else r = mid;
}
return r;
}
};
class Solution {
public:
int findMin(vector<int>& w) {
//最小峰值是唯一的,找到这个峰值即可。与162.寻找峰值类似,区别只在于check条件不同
//false:最小值左侧
//true:最小值及最小值右侧
int n = w.size();
int l = -1, r = n - 1;
while(l + 1 < r){
int mid = l + r >> 1;
if(w[mid] > w[n - 1]) l = mid;//满足条件的左边全为false
else r = mid;//右边全为true
}
return w[r];
}
};
class Solution {
public:
int search(vector<int>& w, int t) {
int n = w.size();
auto isBlue = [&](int i){
int ed = w.back();
if(w[i] > ed)
return t > ed && t <= w[i];
else
return t > ed || t <= w[i];
};
int l = -1, r = n;
while(l + 1 < r){
int mid = l + r >> 1;
if(isBlue(mid)) r = mid;
else l = mid;
}
if(r == n || w[r] != t) return -1;
else return r;
}
};
# 最大化最小值问题
class Solution {
typedef long long LL;
public:
long long maxPower(vector<int>& stations, int r, int k) {
int n = stations.size();
vector<LL> s(n + 5, 0), w(n + 5, 0), diff(n + 5, 0);
auto check = [&](LL mid) -> bool{
fill(diff.begin(), diff.end(), 0);
LL sum_d = 0, add = 0;
for(int i = 1; i <= n; i++){
sum_d += diff[i];
LL need = mid - w[i] - sum_d;
if(need > 0){
add += need;
if(add > k) return false;
sum_d += need;
// diff[i] += need;
if(i + 2 * r + 1 <= n) diff[i + 2 * r + 1] -= need;
}
}
return true;
};
for(int i = 1; i <= n; i++)
s[i] = s[i - 1] + stations[i - 1];
for(int i = 1; i <= n; i++)
w[i] = s[min(i + r, n)] - s[max(i - r - 1, 0)];
//左边是true代表答案及答案左边,右边是false代表答案右边
LL lt = -1, rt = s[n] + k + 1;
while(lt + 1 < rt){
LL mid = lt + ((rt - lt) >> 1);
if(check(mid)) lt = mid;
else rt = mid;
}
return lt;
}
};
# 其他
/*
对所有等差数列的数(1e11个),在数值0~1e6中找到所有等差数列中第m大的数t。
>= t 的数 >= m个 条件(*)
>= t + 1 的数 < m 个,不满足条件(*)
满足二段性,二分
true:答案t及答案t左侧,满足条件(*)
false:答案t右侧,不满足条件(*)
找到 >= x的数有多少个:O(1e6)
二分得到t后,
*/
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N = 1e5 + 5;
int n, m;
int a[N], b[N];
bool check(int x){
LL cnt = 0;
for(int i = 0; i < n; i++){
if(a[i] >= x)
cnt += (a[i] - x) / b[i] + 1;
}
return cnt >= m;
}
int main()
{
scanf("%d %d", &n, &m);
for(int i = 0; i < n; i++) scanf("%d %d", a + i, b + i);
int l = -1, r = 1e6 + 1;
while(l + 1 < r){
int mid = l + r >> 1;
if(check(mid)) l = mid;
else r = mid;
}
// 如果m过大,大于所有等差数列中数的个数,则t不存在,l返回-1
int t = l != -1 ? l : 0;
//求所有等差数列中>= t的数的和
LL ans = 0, cnt = 0;
for(int i = 0; i < n; i++)
if(a[i] >= t){
int ni = (a[i] - t) / b[i] + 1;
cnt += ni;
int end = a[i] - (ni - 1) * b[i];
ans += (LL)(a[i] + end) * ni / 2;
}
ans -= (cnt - m) * t;
printf("%lld\n", ans);
return 0;
}