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

using namespace std;

int main() {
    int N, K;
    cin >> N >> K;

    vector<int> prices(N);
    for (int i = 0; i < N; i++) {
        cin >> prices[i];
    }

    sort(prices.begin(), prices.end());

    int revenue = 0;
    for (int i = 0; i < N; i++) {
        int price = prices[i];
        revenue += price;
        if (i < K) {
            for (int j = i + 1; j < N; j++) {
                prices[j] += price;
            }
        }
    }

    cout << revenue << endl;

    return 0;
}