Description
n天,每天会来一种动物,第
Input
第一行两个整数n和
Output
输出最多可以供多少动物吃
Sample Input
3 4
1 1 1
Sample Output
2
Solution
贪心,第i天来的动物会吃
Code
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<ctime>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int INF=0x3f3f3f3f,maxn=100001;
int n,x,c[maxn];
int main()
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
while(~scanf("%d%d",&n,&x))
{
for(int i=1;i<=n;i++)
scanf("%d",&c[i]),c[i]*=(n-i+1);
sort(c+1,c+n+1);
int sum=0,i=1;
while(i<=n&&sum+c[i]<=x)sum+=c[i],i++;
printf("%d\n",i-1);
}
return 0;
}