Submission
Status:
[PP-SS][SSSSS][SSSSSSSSSS]
Subtask/Task Score:
{0/20}{0/30}{0/50}
Score: 0
User: Pung
Problemset: ห้องสมุดเมือง 3M
Language: cpp
Time: 0.072 second
Submitted On: 2026-03-09 00:03:11
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> increase(20000001,0);
vector<int> pre(20000001,0);
int m = -1;
for(int i = 0; i < n; i++){
int l,r;
cin >> l >> r;
increase[l]++;
increase[r]--;
m = max(m,r);
}
pre[0] = increase[0];
for(int i = 1; i <= m; i++){
pre[i] = increase[i]+pre[i-1];
}
vector<int> sum(m,0);
sum[0] = pre[0];
for(int i = 1; i <= m; i++){
sum[i] = pre[i]+sum[i-1];
}
auto it = lower_bound(sum.begin(), sum.end(),sum[m-1]/2);
cout << it-sum.begin();
}