Postman Gym - 101291J

https://cn.vjudge.net/problem/Gym-101291J

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e5+9;
const int mod=1e9+7;

struct node
{
    int pos,num;
    bool operator < (const node &b)const
    {
        return pos<b.pos;
    }
}p[maxn];

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);


    int n,k;

    scanf("%d%d",&n,&k);

    for(int i=0;i<n;i++)
    {
        scanf("%d%d",&p[i].pos,&p[i].num);
    }

    sort(p,p+n);

    int now=0;
    ll ans=0;

    while(now<n)
    {
        if(p[now].pos>0) break;
        ll cnt=(p[now].num+k-1)/k;
        ans+=abs(p[now].pos)*cnt;
        ll sum=cnt*k;
        while(now<n&&sum&&p[now].pos<0)
        {
            if(p[now].num>sum)
            {
                p[now].num-=sum;
                break;
            }
            else
            {
                sum-=p[now].num;
                now++;
            }
        }
    }

    now=n-1;
    while(now>=0)
    {
        if(p[now].pos<0) break;
        ll cnt=(p[now].num+k-1)/k;
        ans+=p[now].pos*cnt;
        ll sum=cnt*k;
        while(now>=0&&sum&&p[now].pos>=0)
        {
            if(p[now].num>sum)
            {
                p[now].num-=sum;
                break;
            }
            else
            {
                sum-=p[now].num;
                now--;
            }
        }
    }

    printf("%I64d\n",ans*2);

    return 0;
}