import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int[][] a = new int[n][2];
for (int i = 0; i < n; i++) {
a[i][0] = scan.nextInt(); //重量
a[i][1] = scan.nextInt(); //位置
}
Arrays.sort(a, (o1, o2) -> o1[1] - o2[1]);
long[] pre = new long[n];
long p = 0;
for (int i = 0; i < n - 1; i++) {
p += a[i][0];
pre[i + 1] = pre[i] + p * (a[i + 1][1] - a[i][1]);
}
long[] suf = new long[n];
long s = 0;
for (int i = n - 1; i > 0; i--) {
s += a[i][0];
suf[i - 1] = suf[i] + s * (a[i][1] - a[i - 1][1]);
}
long ans = Long.MAX_VALUE;
for (int i = 0; i < n; i++) {
ans = Math.min(ans, pre[i] + suf[i]);
}
System.out.println(ans);
}
}
大石头的搬运工
最新推荐文章于 2024-07-14 22:18:32 发布