Submission #5911350

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <ios> 
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <map>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define sz(c) ((int)(c).size())

using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> P;
const int MAX=5010;
const int INF=1e18;



int main(){
	int N;
	cin>>N;
	int oh[MAX], op[MAX];
	rep(i,N)cin>>oh[i]>>op[i];
	
	set<P> st;
	rep(i,N) st.insert(make_pair(oh[i]+op[i], i));
	
	int A[MAX], B[MAX];
	int ind=0;
	for(auto it=st.begin(); it!=st.end(); it++){
		P p=*it;
		A[ind]=oh[p.second];
		B[ind]=op[p.second];
		ind++;
	}
	ll dp[MAX][MAX];
	rep(i,N+1)dp[i][0]=0;
	rep1(j,N)dp[0][j]=INF;
	rep1(i,N)rep1(j,N){
		dp[i][j]=dp[i-1][j];
		if(dp[i-1][j-1]<=(ll)A[i-1])dp[i][j]=min(dp[i][j], dp[i-1][j-1]+(ll)B[i-1]);
	}
	int ans=0;
	rep1(j,N){
		if(dp[N][j]<INF)ans=j;
	}
	cout<<ans<<endl;
}

Submission Info

Compile Error

./Main.cpp:24:15: warning: overflow in implicit constant conversion [-Woverflow]
 const int INF=1e18;
               ^

Judge Result