Pagini recente » Cod sursa (job #316312) | Cod sursa (job #1175848) | Cod sursa (job #3033425) | Cod sursa (job #1244416) | Cod sursa (job #188487)
Cod sursa(job #188487)
#include <stdio.h>
int main()
{
long long cost,n,i,j,p,q,r,t,k,s;
long long a[30002][2];
long long min;
freopen("bilute.in","r",stdin);
freopen("bilute.out","w",stdout);
s=0;p=0;q=0;r=0;t=0;
a[0][0]=0;a[0][1]=0;
min=(long long) 1000000000*1000000000;
k=1;
scanf("%lld",&n);
for (i=1; i<=n; i++)
{
scanf("%lld %lld",&a[i][0],&a[i][1]);
s+=a[i][0]*a[i][1];
q+=a[i][0];
t+=a[i][0]*(i-1);
}
a[n+1][0]=0;a[n+1][1]=0;
for (i=1; i<=n; i++)
{
cost=s-a[i][0]*a[i][1];
p+=a[i-1][0];
q-=a[i][0];
r+=a[i-1][0];
cost=cost+r;
cost=cost+t;
r+=p;
t-=q;
if (cost<min)
{
min=cost;
k=i;
}
}
printf("%lld %lld\n",k,min);
return 0;
}