Submission

Score: 100

User: gay69

Problemset: โดรน

Language: cpp

Time: 0.003 second

Submitted On: 2025-08-24 10:18:06

#include <bits/stdc++.h>

using namespace std;

const int inf = 1e9;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    const int k = 200;

    int n;
    cin >> n;
    int arr[n], drone[k];
    fill(drone, drone + k, 0);
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
    }
    sort(arr, arr + n, greater<int>());
    int sum = 0;
    for (int i = 0; i < n; i++) {
        int lowest = inf, pos = 0;
        for (int j = 0; j < k; j++) {
            if (drone[j] == 10) {
                continue;
            }
            int val = (drone[j] == 0 ? 1 : 2) * arr[i] * (j + 1);
            if (lowest > val) {
                pos = j;
                lowest = val;
            }
        }
        drone[pos]++;
        sum += lowest;
    }
    cout << sum << "\n";
    return 0;
}