Pagini recente » Cod sursa (job #2907562) | Cod sursa (job #1274674) | Cod sursa (job #753222) | Cod sursa (job #456565) | Cod sursa (job #1992190)
#include<fstream>
#include<set>
#define a first
#define b second
using namespace std;
ifstream fin("lupu.in");
ofstream fout("lupu.out");
int n,x,l,in,r,b[100005];
pair<int,int >v[100005];
int main()
{
fin>>n>>x>>l;
for(int i=1;i<=n;i++)
fin>>v[i].a>>v[i].b;
while(1)
{
int p=1,ma=-1,c=0;
for(int i=1;i<=n;i++)
if(v[i].a-in<=x&&v[i].a-in+l>x&&v[i].b>ma&&b[i]==0)
{
p=0;
ma=v[i].b;
}
if(p==1)
{
for(int i=1;i<=n;i++)
if(v[i].a-in<=x&&v[i].b>ma&&b[i]==0&&v[i].a-in+l<=x)
{
p=0;
ma=v[i].b;
c=i;
}
b[c]=1;
}
if(p==1)
break;
else
r+=ma;
in-=l;
}
fout<<r;
}