oj.uz

Submission #3507

# Submission time Handle Problem Language Result Execution time Memory
3507 2013-08-31T06:13:47 Z Qwaz King of penalty (kriii1_K) C++
1 / 1
 24 ms 1476 KB 
#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;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1476 KB Output is correct
2 Correct 0 ms 1476 KB Output is correct
3 Correct 0 ms 1476 KB Output is correct
4 Correct 4 ms 1476 KB Output is correct
5 Correct 0 ms 1476 KB Output is correct
6 Correct 4 ms 1476 KB Output is correct
7 Correct 8 ms 1476 KB Output is correct
8 Correct 4 ms 1476 KB Output is correct
9 Correct 24 ms 1476 KB Output is correct
10 Correct 20 ms 1476 KB Output is correct
11 Correct 16 ms 1476 KB Output is correct
12 Correct 12 ms 1476 KB Output is correct
13 Correct 0 ms 1476 KB Output is correct
14 Correct 0 ms 1476 KB Output is correct
15 Correct 8 ms 1476 KB Output is correct