Pagini recente » Istoria paginii summer-challenge-21/solutii/portale | Cod sursa (job #2010387) | Cod sursa (job #746642) | Cod sursa (job #2002630) | Cod sursa (job #2022488)
#include <bits/stdc++.h>
#define int long long
using namespace std;
struct Bila{
int l,c;
}v[30005];
main(){
freopen("bilute.in","r",stdin);
freopen("bilute.out","w",stdout);
int n;
long long total=0,Min=LLONG_MAX,poz=0;
scanf("%lld",&n);
long long left=0,right=0,cntleft=0,cntright=0;
for(int i=1;i<=n;++i)
scanf("%lld %lld",&v[i].l,&v[i].c),total+=v[i].l*v[i].c;
for(int i=2;i<=n;++i)
right+=v[i].l*(i-1),cntright+=v[i].l;
for(int i=1;i<=n;++i){
long long x=total+left+right-v[i].l*v[i].c;
if(x<Min){
Min=x;
poz=i;
}
cntleft+=v[i].l;
left+=cntleft;
right-=cntright;
cntright-=v[i+1].l;
}
printf("%lld %lld\n",poz,Min);
}