Submission #1217625

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <array>
#include <cmath>
#include <iterator>
#include <utility>
#include <set>
#include <random>
#include <map>
#include <stack>
#include <queue>
#include <list>
 
using namespace std;
 
int main() {
    unsigned long long n, k, ans = 0;
    vector<int> a;
    cin >> n >> k;
    for (size_t i = 0; i < n; i++)
    {
        int tmp;
        cin >> tmp;
        a.emplace_back(tmp);
    }
 
    sort(a.begin(), a.end());
 
    for (size_t i = 0; i < k; i++)
    {
        ans += a.front() + i;
        a.erase(a.begin());
    }
 
    //for (size_t i = 0; i < k; i++)
    //{
    //    auto itr = min_element(a.begin(), a.end());
    //    ans += *itr + i;
    //    a.erase(itr);
    //}
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result