Pagini recente » Cod sursa (job #32633) | Cod sursa (job #1132220) | Cod sursa (job #482320) | Cod sursa (job #3128229) | Cod sursa (job #190705)
Cod sursa(job #190705)
#include <stdio.h>
int c[30003],d[103],e[103],x1,y1;
long long a[30003],x,y;
long long s,n,m,p,i,j,k;
int main()
{
freopen("bilute.in","r",stdin);
freopen("bilute.out","w",stdout);
scanf("%lld",&n);
for (i=1; i<=n; ++i)
{
scanf("%d %d",&c[i],&y1);
s+=c[i]*y1;
}
fclose(stdin);
freopen("bilute.in","r",stdin);
scanf("%d",&n);
++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)
{
scanf("%d %d",&x1,&y1);
if (a[i]+s-x1*y1<m)
{
m=(long long)(a[i]+s-x1*y1);
p=i;
}
}
printf("%lld %lld\n",p,m);
return 0;
}