Submission
Status:
[PP-SS][SSSSS][SSSSSSSSSS]
Subtask/Task Score:
{0/20}{0/30}{0/50}
Score: 0
User: Test
Problemset: ห้องสมุดเมือง 3M
Language: cpp
Time: 0.005 second
Submitted On: 2025-12-29 22:34:32
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> v(2000001,0);
int mx = 0;
int mn = INT_MAX;
int sum = 0;
for(int i=0;i<n;i++){
int s,e;
cin >> s >> e;
v[s]++;
v[e]--;
mx = max(mx, e-1);
mn = min(mn, s);
sum += (e-s);
}
int temp=0;
for(int i=mn;i<mx;i++){
v[i+1] += v[i];
temp += v[i];
if (temp >= sum/2){
cout << i;
return 0;
}
}
}
/*
int main(){
int n;
cin >> n;
vector<int> v;
int s,e;
for(int i=0;i<n;i++){
cin >> s >> e;
for(int j=s;j<e;j++){
v.push_back(j);
}
}
sort(v.begin(), v.end());
//int med = v.size()/2;
//cout << v[med-1];
for(int i=0;i<v.size();i++){
cout << v[i] << " ";
}
cout << v[v.size()/2-1];
}
*/