Submission
Status:
[PP-SS][SSSSS][SSSSSSSSSS]
Subtask/Task Score:
{0/20}{0/30}{0/50}
Score: 0
User: foldnut
Problemset: ห้องสมุดเมือง 3M
Language: cpp
Time: 0.002 second
Submitted On: 2025-11-13 21:29:05
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int n, sm, a[N], b[N];
bool ok(int x){
int t = 0;
for(int i = 0;i<n;i++){
if(x >= b[i] - 1) t += b[i] - a[i];
else if(x >= a[i]) t += x - a[i] + 1;
}
return t >= sm / 2;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for(int i = 0;i<n;i++) cin >> a[i] >> b[i], sm += b[i] - a[i];
int l = 0, r = 2e9, ans = -1;
while(l <= r){
int md = l + (r - l) / 2;
if(ok(md)) ans = md, r = md - 1;
else l = md + 1;
}
cout << ans;
}