Pagini recente » Cod sursa (job #1979875) | Cod sursa (job #2415279) | Cod sursa (job #730698) | Cod sursa (job #2457187) | Cod sursa (job #2100779)
#include <fstream>
#define MAX 1000000
using namespace std;
int n,G,i,j,wi,gi,d[2][10005],ok,ans,w[1005],g[1005];
int main()
{
ifstream fin("energii.in");
ofstream fout("energii.out");
fin>>n>>G;
ok=0;
ans=MAX;
for(i=1;i<=n;i++)
{
fin>>w[i]>>g[i];
}
for(i=1;i<=G;i++)
{
if(w[1]>=i)d[ok][i]=w[1];
else d[ok][i]=MAX;
}
for(i=1;i<=n;i++,ok=1-ok)
{wi=w[i];gi=g[i];
for(j=1;j<=G;j++)
{
d[1-ok][j]=d[ok][j];
if(wi>=j)
d[1-ok][j]=min(d[1-ok][j],gi);
}
// if(d[1-ok][G]>=G)ans=min(ans,d[1-ok][g]); fout<<d[1-ok][g]<<" ";
//fout<<"\n";
}
fout<<d[ok][G];
return 0;
}