Submission #2850541

---

Source Code Expand

#include<cstdio>
#include<algorithm>
using namespace std;
struct node
{
	int x; long long num;
}a[100005];
long long ans,dis[100005];
inline int read()
{
	char ch=getchar(); int ans=0;
	while (ch<'0'||ch>'9') ch=getchar();
	while (ch<='9'&&ch>='0') ans=ans*10+ch-48,ch=getchar();
	return ans;
}
bool cmp(node t1,node t2){return t1.x<t2.x;}
int main()
{
	int n=read(),s=read();
	for (int i=1; i<=n; i++) a[i].x=read(),a[i].num=read();
	sort(a+1,a+1+n,cmp);
	int l=1,r=n,t=2;
	while (a[l].x<s&&a[r].x>s)
		if (a[l].num<a[r].num) a[r].num+=a[l].num,dis[r]+=dis[l]+((t!=0)?(a[r].x-a[l].x):0),t=0,l++;
		else a[l].num+=a[r].num,dis[l]+=dis[r]+((t!=1)?(a[r].x-a[l].x):0),t=1,r--;
	if (a[l].x>s) ans=dis[r]+a[r].x-s;
	else ans=dis[l]+s-a[l].x;
	printf("%lld\n",ans);
	return 0;
}

Submission Info

Judge Result