Pagini recente » Cod sursa (job #2162549) | Cod sursa (job #1608563) | Cod sursa (job #1902016) | Cod sursa (job #1690887) | Cod sursa (job #1046392)
#include<iostream>
#include<algorithm>
using namespace std;
int rucsac[3][100],n,g,p;
void citeste()
{
cout<<"dati nr de obiecte";cin>>n;
for(int i=1;i<=n;i++){rucsac[0][i]=i;
cout<<"dati greutate ";cin>>rucsac[1][i];
cout<<"dati profit ";cin>>rucsac[2][i];}
}
void sortare()
{
int i,j;
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if (rucsac[2][i]<rucsac[2][j])
{swap(rucsac[0][i],rucsac[0][j]);
swap(rucsac[1][i],rucsac[1][j]);
swap(rucsac[2][i],rucsac[2][j]);}}
int main()
{
citeste();sortare();
int i;
cout<<"greutate max ";cin>>g;
for(i=1;i<=n;i++)
{ g=g-rucsac[1][i];
if(g>-1)
p=p+rucsac[2][i];else i==n;}
cout<<"profit max e "<<p<<" "<<g;
}