제출 #3558

#제출 시각아이디문제언어결과실행 시간메모리
3558jiyong3King of penalty (kriii1_K)C++98
1 / 1
68 ms1940 KiB
#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)
		{
			sum-=(long long)d[solve];
			break;
		}
	}	
	
	int first=p-sum-1;
	long long penalty=(solve>0) ? first : 0;
	long long total=0;

	for(int i=solve-1;i>=0;i--)
	{
		penalty+=(long long)d[i];
		total+=penalty;
	}

	cout << solve << " " << total << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...