Pagini recente » Cod sursa (job #2889197) | Cod sursa (job #2107438) | Cod sursa (job #2981606) | Cod sursa (job #782457) | Cod sursa (job #1996649)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("bilute.in");
ofstream g("bilute.out");
long long l[30001],c[30001],n,d[30001],s[30001],t[30001],r;
int main()
{
long long i,minim,p;
f>>n;
for(i=1;i<=n;i++)
{
f>>c[i]>>l[i];
d[i]=d[i-1]+c[i]*l[i];
s[i]=s[i-1]+c[i];
t[i]=t[i-1]+i*c[i];
}
for(i=1;i<=n;i++)
{
r=(d[n]-c[i]*l[i])+i*s[i-1]-i*(s[n]-s[i])-t[i-1]+(t[n]-t[i]);
if(r<minim)
{
minim=r;
p=i;
}
}
g<<p<<" "<<minim;
return 0;
}