Pagini recente » Cod sursa (job #400453) | Cod sursa (job #1309799) | Cod sursa (job #2660237) | Cod sursa (job #2503242) | Cod sursa (job #2299810)
#include <iostream>
using namespace std;
int cost[1002],e[1002];
int main()
{
int n,w,pret=0;
cin>>n>>w;
for(int i=1;i<=n;i++)
{
cin>>e[i]>>cost[i];
}
for(int i=1;i<n;i++)
for(int j=i+1;j<=n;j++)
{
if(e[i]<e[j])
{
int aux1,aux2;
aux1=e[i];
aux2=cost[i];
cost[i]=cost[j];
e[i]=e[j];
e[j]=aux1;
cost[j]=aux2;
}
}
//for(int i=1;i<=n;i++) cout<<e[i]<<" "<<cost[i]<<'\n';
for(int i=1;i<=n;i++)
{
if(w-e[i]<=0)
{
pret+=cost[i];
break;
}
pret+=cost[i];
w-=e[i];
}
cout<<pret;
return 0;
}