Pagini recente » Cod sursa (job #1824044) | Cod sursa (job #1385816) | Cod sursa (job #878643) | Cod sursa (job #336429) | Cod sursa (job #3209061)
#include<bits/stdc++.h>
using namespace std;
ifstream F("garaj.in");
ofstream G("garaj.out");
#define P pair<short,short>
int n,m,i,u,v=2e9,w;
long long s;
P a[100000];
bool A(P a,P b)
{
return a.first*b.second>a.second*b.first;
}
int main()
{
for(F>>n>>m;i<n;F>>a[i].first>>a[i].second,a[i].second<<=1,++i);
for(;u<v;s>=m?v=w:u=w+1)
for(s=i=0,w=(u+v)>>1;i<n&&s<m;s+=w/a[i].second*a[i].first,++i);
for(s=i=0,sort(a,a+n,A);i<n&&s<m;s+=u/a[i].second*a[i].first,++i);
return G<<u<<' '<<i,0;
}