제출 #99878

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
99878		aer0park	새로운 문제 (POI13_tak)	C++14	0 / 100	1085 ms	4584 KiB

tak

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

ll n,m,d,anw=1,sum,id;
vector<ll> x;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>m>>d>>n;
	for(int i=0;i<n;i++)
	{
		ll a;cin>>a;
		x.push_back(a);
	}	
	sort(x.begin(),x.end());
	id=lower_bound(x.begin(),x.end(),m-d)-x.begin();
	if(id==n)
	{
		cout<<0;
		return 0;
	}
	if(m==d)
		anw=0,id=-1;
	// find x try to be exact
	ll i=n-1;
	while(sum<d&&i>=0)
	{
		if(i==id) continue;
		if(x[i]-d+sum>0)
			sum+=x[i]-d+sum,anw++;
		i--;
	}
	if(sum<d)
	{
		cout<<0;
		return 0;
	}
	cout<<anw;
	return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10