Pagini recente » Cod sursa (job #458900) | Cod sursa (job #487095) | Cod sursa (job #164636) | Cod sursa (job #53900) | Cod sursa (job #2859376)
#include <fstream>
using namespace std;
int c[30005],l[30005];
int main() {
ifstream fin("bilute.in");
ofstream fout("bilute.out");
int n,v,t=0,tmin=100000000;
fin>>n;
if(n%2==0)
v=n/2;
else
v=n/2+1;
for(int i=1;i<=n;i++) {
fin>>c[i];
fin>>l[i];
}
for(int i=1;i<=n;i++) {
t=0;
for(int j=1;j<=n;j++) {
if(j!=i){
if(j-i<0)
t=t+c[j]*l[j]+c[j]*(i-j);
else
t=t+c[j]*l[j]+c[j]*(j-i);
}
}
if(tmin>t) {
tmin=t;
v=i;
}
}
fout<<v<<" "<<tmin;
return 0;
}