2017Nowcoder Girl初赛重现赛 D 打车

题目链接

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string.h>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<vector>
using namespace std;
typedef long long int ll;
const int maxn =1e5+5;
const int maxm=10000;
const int mod =1e9+7;
const int INF=0x3f3f3f3f;
const double eps=1e-8;
int ans,cnt;
int a[maxn],b[maxn];
int main()
{
	int n,s;scanf("%d%d",&n,&s);
	for(int i=0;i<n;i++)scanf("%d",&a[i]);
	sort(a,a+n);
    int vis=0;
    for(int i=0;i<n;i++)
    {
    	ans+=a[i];
    	if(ans>=s){vis=i;break;}
    }
    for(int i=vis;i>=0;i--)
    	if(ans-a[i]>=s) ans-=a[i],vis--;
    printf("%d",vis+1);
    return 0;
}