## https://yukicoder.me/problems/no/1012 class BinaryIndexTree: """ フェニック木(BinaryIndexTree)の基本的な機能を実装したクラス """ def __init__(self, size): self.size = size self.array = [0] * (size + 1) def add(self, x, a): index = x while index <= self.size: self.array[index] += a index += index & (-index) def sum(self, x): index = x ans = 0 while index > 0: ans += self.array[index] index -= index & (-index) return ans def least_upper_bound(self, value): if self.sum(self.size) < value: return -1 elif value <= 0: return 0 m = 1 while m < self.size: m *= 2 k = 0 k_sum = 0 while m > 0: k0 = k + m if k0 < self.size: if k_sum + self.array[k0] < value: k_sum += self.array[k0] k += m m //= 2 if k < self.size: return k + 1 else: return -1 def main(): N, Q = map(int, input().split()) xw = [] for _ in range(N): x, w = map(int, input().split()) xw.append((x, w)) X = list(map(int, input().split())) # xの座標圧縮 x_set = set(X) for x, _ in xw: x_set.add(x) x_list = list(x_set) x_list.sort() x_map = {} for i, x in enumerate(x_list): x_map[x] = i + 1 max_x = len(x_list) # 本番 bit_weight_sum = BinaryIndexTree(max_x) bit_moment_sum = BinaryIndexTree(max_x) for x, w in xw: x_ = x_map[x] bit_weight_sum.add(x_, w) bit_moment_sum.add(x_, w * x) for x in X: x_ = x_map[x] w1 = bit_weight_sum.sum(bit_weight_sum.size) - bit_weight_sum.sum(x_) m1 = bit_moment_sum.sum(bit_moment_sum.size) - bit_moment_sum.sum(x_) w2 = bit_weight_sum.sum(x_) m2 = bit_moment_sum.sum(x_) ans = m1 - w1 * x ans += w2 * x - m2 print(ans) if __name__ == "__main__": main()