Pagini recente » Cod sursa (job #1798919) | Cod sursa (job #914034) | Cod sursa (job #330106) | Cod sursa (job #912064) | Cod sursa (job #1996644)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("bilute.in");
ofstream g("bilute.out");
long l[30001],c[30001],n;
void rezolvare_N2()
{
long i,j,minim=1000001,s,p=1;
for(i=1;i<=n;i++)
{
s=0;
for(j=1;j<=n;j++)
{
if(i!=j)
{
s=s+c[j]*l[j]+c[j]*abs(i-j);
}
}
if(s<minim)
{
minim=s;
p=i;
}
}
g<<p<<" "<<minim;
}
int main()
{
long i;
f>>n;
for(i=1;i<=n;i++)
{
f>>c[i]>>l[i];
}
rezolvare_N2();
return 0;
}