Cod sursa(job #2040634)
| Utilizator | Data | 16 octombrie 2017 08:15:47 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include<algorithm>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
struct obiect{
int g,v;};
obiect x[5010];
int n,G,t;
bool cmp(obiect a, obiect b){
return a.v>b.v;
}
int main()
{
in>>n>>G;
for (int i=1;i<=n;i++)
in>>x[i].g>>x[i].v;
sort(x+1,x+n+1,cmp);
for (int i=1;i<=n;i++)
{
if (x[i].g<=G)
{G-=x[i].g;
t+=x[i].v;
}
}
out<<t;
return 0;
}
