Greedy optimization

Sort + prefix / two-pointer.

Try this in Python

vals = [4, 1, 3]
vals.sort()
print(sum(vals[i] * (i + 1) for i in range(len(vals))))

Key takeaways

• Adjacent swap proof.
• Structure mismatch → not greedy.
• Overflow.