Submission #997995

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int a[1000], n, m, k; pair<int, int>b[1000]; vector<pair<int, int>>c;
int main() {
	cin >> n >> m >> k; for (int i = 0; i < n; i++) { cin >> a[i]; b[i] = make_pair(a[i], -i); }
	sort(b, b + n);
	for (int i = n - k; i < n; i++)c.push_back(make_pair(-b[i].second, b[i].first));
	sort(c.begin(), c.end());
	int sum = 0, cnt = 1;
	for (int i = 0; i < c.size(); i++) { sum += a[c[i].first] * cnt; cnt++; }
	cout << sum << endl;
	return 0;
}

Submission Info

Judge Result