oj.uz

Submission #3529

# Submission time Handle Problem Language Result Execution time Memory
3529 2013-08-31T06:24:56 Z BalloonCollector King of penalty (kriii1_K) C++
0 / 1
 24 ms 1868 KB 
#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.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1868 KB Output is correct
2 Correct 0 ms 1868 KB Output is correct
3 Correct 0 ms 1868 KB Output is correct
4 Correct 4 ms 1868 KB Output is correct
5 Correct 0 ms 1868 KB Output is correct
6 Correct 4 ms 1868 KB Output is correct
7 Correct 8 ms 1868 KB Output is correct
8 Correct 8 ms 1868 KB Output is correct
9 Correct 24 ms 1868 KB Output is correct
10 Correct 20 ms 1868 KB Output is correct
11 Incorrect 16 ms 1868 KB Output isn't correct
12 Halted 0 ms 0 KB -