Submission #997942

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
 
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld; 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;

ll a[100001];
vector<ii> b;
int n,m,k;
int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin>>n>>m>>k;
	for(int i = 0; i < n; i++)
	{
		cin>>a[i];
		b.pb(mp(a[i],i));
	}
	if(m==n)
	{
		sort(b.begin(),b.end());
		reverse(b.begin(),b.end());
		vector<bool> used;
		used.assign(n,0);
		for(int i = 0; i < k; i++)
		{
			used[b[i].se] = 1;
		}
		vi vec;
		for(int i = 0; i < n; i++)
		{
			if(used[i])
			{
				vec.pb(a[i]);
			}
		}
		ll ans = 0;
		for(int i = 0; i < k; i++)
		{
			ans += ll(i+1)*ll(vec[i]);
		}
		cout<<ans<<'\n';
		return 0;
	}
}

Submission Info

Judge Result