Submission #1516725

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define pi acos(-1.0)

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;



int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, k;
    priority_queue <int> maxpq;
    cin >> n >> k;
    REP(i, n){
        int l;
        cin >> l;
        maxpq.push(l);
    }
    int sum = 0;
    REP(i, k){
        sum += maxpq.top();
        maxpq.pop();
    }
    cout << sum << "\n";


    return 0;
}

Submission Info

Judge Result