Pagini recente » Cod sursa (job #1274176) | Cod sursa (job #1441166) | Cod sursa (job #1855402) | Cod sursa (job #930629) | Cod sursa (job #1197619)
#include<iostream>
#include<fstream>
#define maxn 20005
using namespace std;
ifstream f("energii.in");
ofstream g("energii.out");
int j,i,n,maxe,a[2][1005];
main()
{
f>>n>>maxe;
a[0][n]=a[1][n]=0;
for(i=0;i<n;i++)
{
f>>a[0][i]>>a[1][i];
a[0][n]=a[0][i];
a[1][n]=a[1][i];
}
for(i=0;i<n-1;i++)
if(a[1][i]>a[1][i+1])
{
j=a[0][i];
a[0][i]=a[0][i+1];
a[0][i+1]=j;
j=a[1][i];
a[1][i]=a[1][i+1];
a[1][i+1]=j;
}
for(i=n-1;i>=0;i--)
if(a[0][i+1]-a[0][i]>=maxe)
{
a[0][n]=a[0][i+1]-a[0][i];
a[1][n]=a[1][i+1]-a[1][i];
}
g<<a[1][n];
g.close();
return 0;
}