698 B | 698 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
# sys.setrecursionlimit(10**7)
BLANK = " "
# inp = input
inp = lambda : sys.stdin.readline().rstrip()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
p = print
def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def solve():
n = ii()
l = [mii() for _ in range(n)]
ans = 0
A = []
for a, b in l:
ans += b
A.append(a)
A.sort()
ans += sum([(i + 1) * A[i] for i in range(n)])
p(ans)
if __name__ == "__main__":
tc = 1
for t in range(1, tc+1):
ret = solve()