Pagini recente » Cod sursa (job #1758967) | Cod sursa (job #1023019) | Cod sursa (job #647411) | Solutii preONI 2006, Runda a 4-a | Cod sursa (job #2112799)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("garaj.in");
ofstream fout("garaj.out");
int n, solt;
unsigned long long m;
struct camion{
int c, t, utilizabil;
}v[100002];
inline bool cmp(const camion a, const camion b)
{
return a.utilizabil>b.utilizabil;
}
int main()
{
int i, st=0, dr=INT_MAX, mijl;
unsigned long long sump;
fin>>n>>m;
for(i=1; i<=n; i++) fin>>v[i].c>>v[i].t, v[i].t*=2;
while(st<=dr)
{
sump=0;
mijl=st+(dr-st)/2;
for(i=1; i<=n && sump<m; i++)
sump=sump+(unsigned long long)v[i].c*(mijl/v[i].t);
if(sump>m) solt=mijl, dr=mijl-1;
else st=mijl+1;
}
for(i=1; i<=n; i++) v[i].utilizabil=v[i].c*(solt/v[i].t);
sort(v+1,v+n+1,cmp);
sump=0;
for(i=1; i<=n && sump<m; i++)
sump+=(unsigned long long)v[i].utilizabil;
fout<<solt<<' '<<i-1<<'\n';
return 0;
}