Submission
Status:
[P-SSS][SSSSS][SSSSSSSSSS]
Subtask/Task Score:
{0/20}{0/30}{0/50}
Score: 0
User: yypp
Problemset: ห้องสมุดเมือง 3M
Language: cpp
Time: 0.002 second
Submitted On: 2026-03-25 15:01:59
#include <bits/stdc++.h>
using namespace std;
int bki[105];
int main() {
int n,bk=0,t1,t2,maxt1=INT_MIN;
cin >> n;
for (int i=0;i<n;i++) {
cin >> t1 >> t2;
bki[t1] = t2-t1;
bk += t2-t1; maxt1 = max(maxt1,t1);
}
int mid = bk/2;
for (int i=0;i<=maxt1;i++) {
//printf("%d %d %d\n",i,mid,bki[i]);
if (bki[i]==0) continue;
if (bki[i]<mid) {
mid -= bki[i];
}
else {
cout << i+mid-1;
return 0;
}
}
}