Submission #24,884

2026-02-16 13:23:06

cpp17

Accepted 40/40

98ms

1308 KiB

#include <bits/stdc++.h>
using namespace std;
using ll=long long;

const int maxn=1e5+1;
int n,k,l[maxn],r[maxn];

ll cnt(ll kk){
    ll res=0;
    int a=kk,b=kk+k-1;
    for(int i=0;i<n;i++){
        res+=max(0,l[i]-a);
        res+=max(0,b-r[i]);
    }
    return res;
}

int main(){
    cin>>n>>k;
    for(int i=0;i<n;i++)cin>>l[i]>>r[i];
    ll a=1,b=1e9-k;
    while (a<b){
        ll m=(a+b)/2;
        if(cnt(m)<cnt(m+1))b=m;
        else a=m+1;
    }
    cout<<min(cnt(a),cnt(b))<<'\n';
}

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	1ms	512 KiB
		2	Accepted	0/0	1ms	508 KiB
		3	Accepted	1/1	1ms	316 KiB
		4	Accepted	1/1	1ms	316 KiB
		5	Accepted	1/1	1ms	316 KiB
		6	Accepted	1/1	2ms	316 KiB
		7	Accepted	2/2	2ms	316 KiB
		8	Accepted	2/2	1ms	316 KiB
		9	Accepted	2/2	2ms	316 KiB
		10	Accepted	2/2	2ms	316 KiB
		11	Accepted	2/2	39ms	804 KiB
		12	Accepted	2/2	39ms	796 KiB
		13	Accepted	2/2	39ms	792 KiB
		14	Accepted	2/2	39ms	552 KiB
		15	Accepted	2/2	79ms	1076 KiB
		16	Accepted	2/2	79ms	1032 KiB
		17	Accepted	2/2	48ms	564 KiB
		18	Accepted	2/2	48ms	580 KiB
		19	Accepted	2/2	50ms	564 KiB
		20	Accepted	2/2	50ms	556 KiB
		21	Accepted	1/1	48ms	600 KiB
		22	Accepted	1/1	48ms	564 KiB
		23	Accepted	1/1	97ms	1080 KiB
		24	Accepted	1/1	97ms	1052 KiB
		25	Accepted	1/1	97ms	1076 KiB
		26	Accepted	1/1	97ms	1076 KiB
		27	Accepted	1/1	98ms	1308 KiB
		28	Accepted	1/1	97ms	1076 KiB