Cod sursa(job #2137027)
| Utilizator | Data | 20 februarie 2018 15:36:45 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
using namespace std;
struct rucsac
{
float p,g;
float r;
};
int i,j,n;
float k,sum,gmax;
rucsac v[1001];
int main()
{
cin>>n>>gmax;
for(i=1;i<=n;i++)
{
cin>>v[i].g>>v[i].p;
v[i].r=(float)(v[i].p/v[i].g);
}
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if(v[i].r<v[j].r)
swap(v[i],v[j]);
i=1;
while(gmax-v[i].g>0 and i<=n)
{
gmax=gmax-v[i].g;
sum=sum+v[i].p;
i++;
}
if(gmax>0)
sum=sum+gmax*v[i].r;
cout<<sum;
return 0;
}
