Pagini recente » Cod sursa (job #2701691) | Cod sursa (job #2847605) | Cod sursa (job #600285) | Cod sursa (job #1331573) | Cod sursa (job #190707)
Cod sursa(job #190707)
#include <stdio.h>
int c[30003],l[30003],d[103],e[103],i,j,k,p,n;
long long a[30003],x,y;
long long s,m;
int main()
{
freopen("bilute.in","r",stdin);
freopen("bilute.out","w",stdout);
scanf("%d",&n);
for (i=1; i<=n; ++i)
{
scanf("%d %d",&c[i],&l[i]);
s+=c[i]*l[i];
}
++d[c[1]];
++e[c[n]];
x=0;
y=0;
for (i=2, k=n-1; i<=n; ++i, --k)
{
a[i]+=x;
a[k]+=y;
for (j=1; j<101; ++j)
{
a[i]+=j*d[j];
x+=j*d[j];
a[k]+=j*e[j];
y+=j*e[j];
}
++e[c[k]];
++d[c[i]];
}
m=(long long) 1000000000*1000000000;
p=0;
for (i=1; i<=n; ++i)
{
if (a[i]+s-c[i]*l[i]<m)
{
m=(long long)(a[i]+s-c[i]*l[i]);
p=i;
}
}
printf("%d %lld\n",p,m);
return 0;
}