Submission #1843454

---

Source Code Expand

#include <iostream>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <string>
#include <functional>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
typedef long long ll;
const int INF = 100000000, mod = 1000000007;
const ll LLINF = 1LL << 50;
using namespace std;


ll n, k, first, a[100005];


int main() {
    cin >> n >> k;
    cin >> first;
    for (int i = 0; i < n-1; i++) cin >> a[i];
    sort(a, a + n, greater<int>());
    ll sum = (first + first + k - 1)*k / 2;
    ll exists = first;
    for (int i = 0; i < k - 1; i++) exists += a[i];
    cout << sum - exists << endl;
    return 0;
}

Submission Info

Judge Result