Submission #3520

#TimeUsernameProblemLanguageResultExecution timeMemory
3520BalloonCollectorKing of penalty (kriii1_K)C++98
0 / 1
24 ms1476 KiB
#include <cstdio>
#include <algorithm>
using namespace std;
int p,n,a[100001],s,re;
long long pn,sum;

int main(void){
	
	scanf("%d %d",&p,&n);
	for(int i=0; i<n; i++)
		scanf("%d",&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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...