Submission

[PPPPP][PPPPP][PPPPPPPPPP]

Score: 100

User: namnueng_good

Problemset: ห้องสมุดเมือง 3M

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-24 23:50:47

#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n,a[105],b[105],l,r,md,re;
int f(int vl){
  int res=0;
  for(int i=1; i<=n; i++){
    if(a[i]>=vl){
        continue;
    }if(b[i]<=vl){
        res+=b[i]-a[i];
    }else{
        res+=vl-a[i];
    }
  }
  return res;
}

int main() {
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i]>>b[i];
        re+=b[i]-a[i];
    }re=re/2;
    if(n==1&&b[1]-a[1]==1){
        cout<<a[1];
        return 0;
    }l=0;
    r=20000000;
    while(l<r){
        md=(l+r)/2;
        if(f(md)<re){
            l=md+1;
        }else{
            r=md;
        }
    }cout<<--l;
}