Maximize weighted sum with disjoint adjacent swaps

You are given an integer array `arr` of length `n` (0-indexed). Define the weighted sum as: `S = Σ_{i=0..n-1} arr[i] * (i + 1)`. You may perform any number of **adjacent swaps** of the form swap `arr[i]` and `arr[i+1]`, with the constraint that **each array position can be involved in at most one swap** (i.e., chosen swaps must be **non-overlapping**). Return the **maximum possible** value of `S` after performing such swaps. Constraints (typical for this OA style): `1 ≤ n ≤ 2e5`, `|arr[i]|` fits in 32-bit signed integer. Output may require 64-bit integer.