Submission #4111

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
4111	2013-09-01 15:13:39	jays	King of penalty (kriii1_K)	C++98	0 / 1	20 ms	1624 KiB

K

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <algorithm>
#include <cstdio>
#include <vector>
typedef long long ll;
using namespace std;
int P, N;
pair<int,ll> solve(const vector<int>& p) {
  int cnt = -1, st = 0;
  while (st + p[cnt+1] < P) {
    st += p[cnt+1];
    cnt++;
  }
  cnt += 1;
  int extra = P - st - 1;
  int sum = 0;
  for (int i = 0; i < cnt; ++i) {
    sum += (cnt-i) * p[cnt-i-1];
  }
  return make_pair(cnt, sum + extra * cnt);
}
int main() {
  scanf("%d%d", &P, &N);
  vector<int> penalty(N, 0);
  for (int i = 0; i < N; ++i)
    scanf("%d", &penalty[i]);
  sort(penalty.begin(), penalty.end());
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 1