提出 #510433

---

ソースコード 拡げる

//-------------include
#include<cstdio>
#include<string>
#include<iostream>
#include<cstring>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<vector>
#include<list>
#include<deque>
#include<functional>
#include<sstream>

//-------------define
#define ALL(a)  (a).begin(),(a).end()
#define PB push_back
#define MP make_pair
#define SORT(c) sort((c).begin(),(c).end())
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define CLR(a) memset((a), 0 ,sizeof(a))
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define fi first
#define se second

//-------------namespace
using namespace std;

//-------------inline
inline int toInt(string s) {int v; istringstream istr(s);istr>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//-------------typedef
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;

//-------------var
int dx[]={0,-1,0,1,1,1,-1,-1};
int dy[]={1,0,-1,0,1,-1,1,-1};

int main()
{
  ios_base::sync_with_stdio(false);
  int n,t;
  cin >> n >> t;

  vector< pair<int, pair<int, int> > > s(n+1);
  ll sum = 0;
  for(int i=0;i<n;i++){
    cin >> s[i].se.fi >> s[i].se.se;
    sum += s[i].se.fi;
    s[i].fi = s[i].se.fi - s[i].se.se;
  }

  sort(s.begin(), s.end(), greater<pair<int, pair<int, int> > >());

  int in = 0, cnt = 0;
  while(sum > t){
    sum -= s[in++].fi;
    cnt++;
    if(in >= n)break;
  }

  if(sum > t)cout << -1 << endl;
  else cout << cnt << endl;
  return 0;
}

提出情報

ジャッジ結果