Pagini recente » Cod sursa (job #2052384) | Cod sursa (job #496980) | Cod sursa (job #2357372) | Cod sursa (job #985214) | Cod sursa (job #137736)
Cod sursa(job #137736)
#include<fstream>
using namespace std;
const int N=30001;
long long n,c[N],l[N],num,lust,before[N],cost_before[N],m,after,cost_after,aux,j,i;
int main()
{
ifstream f("bilute.in");
ofstream g("bilute.out");
f>>n;
for(i=1;i<=n;i++){
f>>c[i]>>l[i];
num+=c[i];
lust+=c[i]*l[i];
before[i+1]=before[i]+c[i];
cost_before[i+1]=cost_before[i]+before[i+1];}
m=2000000000000;
for(i=n;i>=1;i--){
aux=cost_before[i]+lust-c[i]*l[i]+cost_after;
if(aux<=m){ m=aux; j=i;}
after+=c[i];
cost_after+=after;}
g<<j<<" "<<m<<endl;
g.close();
}