Pagini recente » Cod sursa (job #3275181) | Cod sursa (job #1507359) | Cod sursa (job #2301280) | Cod sursa (job #2834702) | Cod sursa (job #1579780)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
struct ob
{
float pret,kg;
};
int comp(ob a,ob b)
{
if(a.pret/a.kg==b.pret/b.kg)
return (a.pret>b.pret);
return (a.pret/a.kg>b.pret/b.kg);
}
int n,G,i,s;
ob v[5001];
int main()
{
f>>n>>G;
for(i=1;i<=n;i++)
{
f>>v[i].kg;
f>>v[i].pret;
}
sort(v+1,v+n+1,comp);
/*for(i=1;i<=n;i++)
cout<<v[i].kg<<" "<<v[i].pret<<'\n';*/
s=0;
for(i=1;i<=n&&G>0;i++)
{
if(v[i].kg<=G){s+=v[i].pret;G-=v[i].kg;}
else break;
}
g<<s+2;
return 0;
}