Pagini recente » Cod sursa (job #1500312) | Cod sursa (job #1748401) | Cod sursa (job #544949) | Cod sursa (job #2112403) | Cod sursa (job #2877409)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("lupu.in");
ofstream fout("lupu.out");
struct ceva
{
long long int t,l;
};
ceva v[100005];
int main()
{
long long int n,x,l,inc=0,sum=0;
fin>>n>>x>>l;
for(int i=0;i<n;i++)
fin>>v[i].t>>v[i].l;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
if(v[i].l<v[j].l)
{
swap(v[i].l,v[j].l);
swap(v[i].t,v[j].t);
}
else if(v[i].l==v[j].l && v[i].t>v[j].t)
{
swap(v[i].l,v[j].l);
swap(v[i].t,v[j].t);
}
}
}
for(int i=0;i<n;i++)
{
if(inc+v[i].t<=x)
{
sum+=v[i].l;
inc+=l;
}
}
fout<<sum;
}