Submission #3507

#TimeUsernameProblemLanguageResultExecution timeMemory
3507QwazKing of penalty (kriii1_K)C++98
1 / 1
24 ms1476 KiB
#include <cstdio>
#include <algorithm>

const int MAX=100020;
typedef long long ll;

int time, n, data[MAX];

void input(){
	scanf("%d%d", &time, &n);

	int i;
	for(i=0; i<n; i++)
		scanf("%d", &data[i]);
}

void solve(){
	std::sort(data, data+n);

	int i, cnt=0;
	for(i=0; cnt+data[i]<time && i<n; i++)
		cnt += data[i];

	int max=i, now=time-cnt-1;
	ll panelty=0;
	for(i=max-1; i>=0; i--){
		now += data[i];
		panelty += now;
	}

	printf("%d %lld\n", max, panelty);
}

int main(){
	input();

	solve();

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...