1 solutions
-
0
Guest MOD
- 1
Information
- ID
- 1606
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 7
- Tags
- (None)
- # Submissions
- 71
- Accepted
- 14
- Uploaded By
#include<bits/stdc++.h> using namespace std; int main(){ int n,x; cin>>n>>x; int a,b; int max=-1; int maxx=-1; for(int i=0;i<n;i++){ cin>>a>>b; if(a-b>max){ max=a-b; } if(a>maxx){ maxx=a; } } int l=0; int cnt=0; while(l<=x-maxx){ cnt++; l=l+max; } cout<<cnt+1; return 0; }
By signing up a Hydro universal account, you can submit code and join discussions in all online judging services provided by us.