Submission #3529

#	Time	Username	Problem	Language	Result	Execution time	Memory
3529		BalloonCollector	King of penalty (kriii1_K)	C++98	0 / 1	24 ms	1868 KiB

K

#include <cstdio>
#include <algorithm>
using namespace std;
int n,re;
long long a[100001],s;
long long p,pn,sum;

int main(void){
	
	scanf("%lld %d",&p,&n);
	for(int i=0; i<n; i++)
		scanf("%lld",&a[i]);
	sort(a,a+n);
	for(int i=0; i<n; i++){
		if(s+a[i]>=p){
			re=i;
			
			break;
		}
		else s+=a[i];
	}
	sum=(long long)(p-s-1);
	for(int j=re-1; j>=0; j--){
		pn+=sum+a[j];
		sum+=a[j];
	}
	printf("%d %lld",re,pn);
	return 0;
}

• Subtask 1: 0 / 1