Submission #3511

#	Time	Username	Problem	Language	Result	Execution time	Memory
3511		jiyong3	King of penalty (kriii1_K)	C++98	0 / 1	0 ms	1940 KiB

K

#include <iostream>
#include <algorithm>
using namespace std;

#define MAXN 100000

int main()
{
	int p,n;
	int d[MAXN];

	cin >> p >> n;
	for(int i=0;i<n;i++)
		cin >> d[i];
	sort(d,d+n);

	long long sum=0;
	int solve;
	for(solve=0;solve<n;solve++)
	{
		sum+=(long long)d[solve];
		if(sum>=p)
			break;
	}
	
	sum-=(long long)d[solve];
	int first=p-sum-1;
	long long penalty=(solve>0) ? first+d[solve-1] : 0;

	for(int i=solve-2;i>=0;i--)
		penalty+=(long long)(penalty+d[i]);

	cout << solve << " " << penalty << endl;
}

• Subtask 1: 0 / 1