C++ 代码

p = []
w = []
d = []
cost = 1e18
def check(x):
    global cost
    res = 0
    for i in range(len(p)):
        if abs(x-p[i])>d[i]:
            res += (abs(x-p[i])-d[i])*w[i]
    cost = min(cost,res)
    return res;

if __name__ == '__main__':
    n = int(input())
    for i in range(n):
        a,b,c = map(int,input().split())
        p.append(a)
        w.append(b)
        d.append(c)
    l = 0
    r = 1e9+10
    while l<r:
        lmid = l+(r-l)//3
        rmid = r-(r-l)//3
        if check(lmid)>=check(rmid): l = lmid+1
        else: r = rmid-1
    print(int(cost))