#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

class Solution {
public:
    int calculatedPointerAlignment(vector<int>& crates) {
        sort(crates.begin(), crates.end());
        int n = crates.size();
        long long total = 0;
        for (int i = 0; i < n; i++) {
            total += (long long)crates[i] * (i + 1);
        }
        return (int)total;
    }
};

int main() {
    vector<int> crates = {3, 1, 2};
    Solution sol;
    cout << sol.calculatedPointerAlignment(crates) << endl;
    return 0;
}

import java.util.*;

class Solution {
    public int calculatedPointerAlignment(int[] crates) {
        Arrays.sort(crates);
        int total = 0;
        for (int i = 0; i < crates.length; i++) {
            total += crates[i] * (i + 1);
        }
        return total;
    }

    public static void main(String[] args) {
        Solution sol = new Solution();
        int[] crates = {3, 1, 2};
        System.out.println(sol.calculatedPointerAlignment(crates));
    }
}

from typing import List

class Solution:
    def calculatedPointerAlignment(self, crates: List[int]) -> int:
        crates.sort()
        total = 0
        for i, val in enumerate(crates):
            total += val * (i + 1)
        return total

if __name__ == "__main__":
    sol = Solution()
    print(sol.calculatedPointerAlignment([3, 1, 2]))

/**
 * @param {number[]} crates
 * @return {number}
 */
var calculatedPointerAlignment = function(crates) {
    crates.sort((a, b) => a - b);
    let total = 0;
    for (let i = 0; i < crates.length; i++) {
        total += crates[i] * (i + 1);
    }
    return total;
};

console.log(calculatedPointerAlignment([3, 1, 2]));