Pagini recente » Cod sursa (job #1304301) | Cod sursa (job #2560018) | Cod sursa (job #2263422) | Cod sursa (job #1347973) | Cod sursa (job #1906336)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("energii.in");
ofstream h("energii.out");
int g, w, n, a[10001], b[10001], cost, energ[100], x;
int main()
{
f >> g;
f >> w;
for(int i = 0; i < g; i++)
{
f >> a[i] >> b[i];
}
cost = 5002;
for(int i = 0; i < g; i++)
{
for(int j = 0; j < g; j++)
{
if(a[i] == a[j])
{
if((a[i] >= w) && (b[i] < cost))
{
cost = b[i];
energ[x++] = a[i];
}
}
else
{
if((a[i] + a[j] >= w) && (b[i] + b[j] < cost))
{
cost = b[i] + b[j];
}
}
}
}
h << cost;
return 0;
}