Cod sursa(job #1612060)
Utilizator | Data | 24 februarie 2016 18:04:15 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
#define L_MAX 100000
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int gr[L_MAX], val[L_MAX];
int main()
{
int n, m, i, y, x, j, s=0;
f>>n>>m;
for(i=1; i<=n; i++)
f>>gr[i]>>val[i];
for(i=2; i<=n; i++)
{
x=val[i]; y=gr[i];
j=i-1;
while(j>=1 && val[j]<x)
{val[j+1]=val[j];
j--;
}
val[j+1]=x; gr[j+1]=y;
}
for(i=1; i<=n ; i++)
if(gr[i]<m && m>=0)
{
s=s+val[i];
m=m-gr[i];
}
g<<s;
return 0;
}