Submission #2137589

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <iomanip>
#include <algorithm>
#include <tuple>
#include <queue>
#include <set>
#include <math.h>
#include <array>
#include <list>
#include <set>
#define MOD 1000000007
#define INF 1000000000
using namespace std;
typedef long long ll;
typedef tuple<ll,int,int> p;
typedef vector<int> vi;
set <int> st;
vector<int> videos(105);
double now=0;
queue<int> num;
int  n,k,tmp=0,cnt=0;
int a[1000];
int main(int argc,char const* argv[])
{
  cin >> n >> k;
  for(int i=0;i<n;i++)
    {
      cin >> a[i];
    }
  sort(a,a+n,greater<int>());
  for(int i=0;i<n;i++)
    {
      tmp+=a[i];
      cnt++;
      if(tmp>=k) break;
    }
  if(tmp<k)
    {
      cout << -1 << endl;
      return 0;
    }
  cout << cnt << endl;
  return 0;
}

Submission Info

Judge Result