Submission #1168352

---

Source Code Expand

#include<bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
#define R(i,a,n) for(int i=a;i<n;i++)
#define re(i,n) for(int i=n-1;i>=0;i--)
using namespace std;
#define INF 1<<29
int main(){
  int n,k,i,sum=0,c=0;
  long long s[5000]={0};
  cin>>n>>k;
  int a[n];
  r(i,n)cin>>a[i];
  sort(a,a+n);
  s[0]=a[0];
  for(i=n-1;i>=0;i--){
    sum=0;
    for(int j=i;j>=0;j--){
      sum+=a[j];
      if(sum>=k)break;
      if(!j)goto L;
    }
  }
  L:cout<<i+1<<endl;
  //if(0)L:cout<<n<<endl;
}

Submission Info

Judge Result