Codeforces Round #538 (Div. 2) B. Yet Another Array Partitioning Task(思维)

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,k;
ll pre[200005], a[200005];

bool cmp(ll a, ll b){
	return a > b;
}

int main()
{
	scanf("%d%d%d",&n,&m,&k);
	vector<ll> v, G;
	ll sum = 0;
	for(int i=1;i<=n;i++){
		scanf("%lld",&pre[i]);
		a[i] = pre[i];
	}
	map<ll,int> ma;
	sort(pre + 1, pre + 1 + n, cmp);
	for(int i=1;i<=k*m;i++){
		sum += pre[i];
		ma[pre[i]] ++;
	}
	printf("%lld\n", sum);
	int pos = 0;
	int cnt = 0;
	for(int i=1;i<=n;i++){
		if(pos == k - 1)break;
		if(ma[a[i]] != 0){
			cnt ++;
			ma[a[i]] --;
		}
		if(cnt == m){
			printf("%d ",i );
			pos ++;
			cnt = 0;
		}
	}
	return 0;
}