Pagini recente » Cod sursa (job #2436663) | Cod sursa (job #2941401) | Cod sursa (job #1641167) | Cod sursa (job #317037) | Cod sursa (job #1579785)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("rucsac.in");
ofstream h("rucsac.out");
int n,i,a,pt,gmax;
struct ruc
{
int p,g;
int o;
}v[5001];
int compar(ruc a,ruc b){
return (float)a.p/a.g>(float)b.p/b.g;}
int main()
{
f>>n>>gmax;
for(i=1;i<=n;i++) f>>v[i].g>>v[i].p;
sort(v+1,v+n+1,compar);
i=1;
while(gmax>0 && i<=n)
{
if(v[i].g<=gmax) {pt+=v[i].p;gmax-=v[i].g;}
i++;
}
h<<pt;
f.close();
h.close();
return 0;
}