#include #define rep(i,n) for(long long int (i)=0;(i)<(int)(n);(i)++) #define rrep(i,a,b) for(long long int i=(a);i<(b);i++) #define rrrep(i,a,b) for(long long int i=(a);i>=(b);i--) #define all(v) (v).begin(), (v).end() #define pb(q) push_back(q) #define P pair #define Abs(a,b) max(a,b)-min(a,b) #define YES(condition) if(condition){cout << "YES" << endl;}else{cout << "NO" << endl;} #define Yes(condition) if(condition){cout << "Yes" << endl;}else{cout << "No" << endl;} #define Cout(x) cout<<(x)<1){ cmp=(cmp*hh)%MOD; hh--; } return cmp; } long long int ruizyo(long long int aa, long long int bb){ if(aa==0){ return 1; } else if(aa%2==0){ long long int tt=ruizyo(aa/2,bb); return (tt*tt)%MOD; } else{ return (ruizyo(aa-1,bb)*bb)%MOD; } }フェルマ-のア --------------------------------------------------------------- while(x!=0){ sum+=x%10; / x/=10; } 各桁の和 --------------------------------------------------------------- pair p[100000]; cin >> tmp; p[i]=make_pair(tmp,i); cout << p[i].second+1 << endl;//ペアの右側つまりiを出力 --------------------------------------------------------------- s.find(w[i])==string::npos findの使い方 --------------------------------------------------------------- for(int i=0;i>(10,vector(10,false));アを全部falseに --------------------------------------------------------------- long long gcd(long long aaa,long long bbb){ if(bbb==0){ return aaa; } return gcd(bbb,aaa%bbb); } long long lcm(long long aaa,long long bbb){ long long g = gcd(aaa,bbb); return aaa/g * bbb; }左から最大公約数と最小公倍数 --------------------------------------------------------------- long long int prime_cnt[10000]; for(int i=2;i*i<=n;i++){ while(n%i==0){ n/=i; prime_cnt[i]+=1; } if(n>1){ prime_cnt[n]+=1; break; } }ある数nを素因数分解しましょう ---------------------------------------------------------------*/ long long int n,cnt=0,ans=0,a,b,c,d,cmp,cmpp,m,h,w[1000000],v[1000000],x,y,sum=0,pos,dp[101][1000002]; int dy[]={1,0,-1,0}; int dx[]={0,1,0,-1}; string alph("abcdefghijklmnopqrstuvwxyz"),s; bool fl=true; //-------------------------↓↓↓↓↓↓------------------------ int main(void){ cin.tie(0); ios::sync_with_stdio(false); cin >> n; rep(i,n)cin>>v[i]>>w[i]; cin>>a; rep(i,n){ rep(j,100006){ if(j>=w[i]){ dp[i+1][j]=max(dp[i][j-w[i]]+v[i],dp[i][j]); } else{ dp[i+1][j]=dp[i][j]; } } } ll ansmin=INF; ll ansmax=0; rep(i,100006){ if(dp[n][i]==a){ ansmin=min(ansmin,i); ansmax=max(ansmax,i); } } if(ansmin==0){ Cout(1); } else{ Cout(ansmin); } if(ansmax>=999999){ Cout("inf"); } else{ Cout(ansmax); } return 0; }