Pagini recente » Cod sursa (job #3345540) | Cod sursa (job #420050) | Cod sursa (job #683672) | Cod sursa (job #3344829) | Cod sursa (job #3335378)
#include <bits/stdc++.h>
using namespace std;
ifstream in("carnati.in");
ofstream out("carnati.out");
struct ura
{
int t,p;
};
ura v[2005];
bool cmp(ura a, ura b)
{
return a.t<b.t;
}
int main()
{
int n,c;
in>>n>>c;
for(int i=1;i<=n;i++)
in>>v[i].t>>v[i].p;
sort(v+1,v+n+1,cmp);
v[0].t=v[1].t;
int ssm=-1;
for(int i=1;i<=n;i++)
{
int aux=v[i].p,s=0;
for(int j=1;j<=n;j++)
{
s-=(v[j].t-v[j-1].t)*c;
s=max(0,s);
if(v[j].p>=aux)
s+=aux;
ssm=max(ssm,s);
}
}
out<<ssm-c;
return 0;
}