Submission

Status:

[P-SSS][SSSSS][SSSSSSSSSS]

Subtask/Task Score:

{0/20}{0/30}{0/50}

Score: 0

User: Gunto

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-04 20:42:47

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int avg=0;
    vector<int> a(n,0),b(n,0); 
    for(int i=0;i<n;++i){
        cin>>a[i]>>b[i];   
        avg+=b[i]-a[i]; 
    } 
    avg/=2;
    //this is position
    //arrange min to max
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    int sum=0;
    int out;
    for(int i=0;i<a.size();++i){
        sum+=b[i]-a[i];
        if(sum>=avg){
            //using that i 
            int change=0;
            for(int j=0;j<=i-1;++j){
                change+=b[j]-a[j];
            }avg-=change;
            //avg remain
            while(avg!=0){
                a[i]++;
                avg--;
            }
            out=a[i];
            cout<<out-1;
            return 0;
        }
    }
    return 0;
}