Pagini recente » Cod sursa (job #788552) | Cod sursa (job #1662499) | Cod sursa (job #864531) | Cod sursa (job #2944640) | Cod sursa (job #273513)
Cod sursa(job #273513)
#include <stdio.h>
#define lg_max 30005
struct pom
{
long long c,l;
} a[lg_max];
long long s[lg_max],v[lg_max];
int n;
void citire()
{
scanf ("%d",&n);
for (int i=1; i<=n; ++i)
{
scanf ("%d%d",&a[i].c,&a[i].l);
s[i]=s[i-1]+a[i].c;
}
}
void solve ()
{
int p_min=1;
for (int i=2; i<=n; ++i)
v[1]+=((i-1)*a[i].c+a[i].c*a[i].l);
for (int i=2; i<=n; ++i)
v[i]=v[i-1]+a[i-1].c*a[i-1].l-a[i].c*a[i].l+s[i-1]-(s[n]-s[i-1]);
for (int i=2; i<=n; ++i)
if(v[i]<v[p_min])
p_min=i;
printf("%d %lld",x,v[x]);
}
int main ()
{
freopen ("bilute.in","r",stdin);
freopen ("bilute.out","w",stdout);
citire();
solve();
return 0;
}