Pagini recente » Cod sursa (job #2004819) | Cod sursa (job #2355518) | Cod sursa (job #202795) | Cod sursa (job #2227212) | Cod sursa (job #1609873)
#include <fstream>
using namespace std;
ifstream f("lupu.in");
ofstream g("lupu.out");
int main()
{
long int nr=1,n,s=0;
int x,l;
f>>n>>x>>l;
long int v[n],b[n],aux[n];
bool k=0;
int y;
while(f>>y)
if(y<=x)
{
v[nr]=y;
f>>b[nr];
nr++;
}
long int max,maxi;
while(!k)
{
max=0;maxi=0;
for(int j=1;j<nr;j++)
if(b[j]>max)
{
max=b[j];
maxi=j;
}
if(max>0)
{
s=s+max;
for(int i=1;i<nr;i++)
{
v[i]=v[i]+l;
if(v[i]>x)
{
v[i]=0;
b[i]=0;
}
}
b[maxi]=0;
v[maxi]=0;
}
else
k=1;
}
g<<s;
return 0;
}