Pagini recente » Cod sursa (job #490703) | Cod sursa (job #1326764) | Cod sursa (job #33372) | Cod sursa (job #2457281) | Cod sursa (job #2020718)
#include <iostream>
#include <cstdio>
using namespace std;
const int MAX_N = 3e4;
int c[1 + MAX_N];
int l[1 + MAX_N];
int main() {
freopen( "bilute.in", "r", stdin );
freopen( "bilute.out", "w", stdout );
int n, num_left = 0, num_right = 0, loss1 = 0, loss2 = 0;
cin >> n;
for ( int i = 1; i <= n; i ++ ) {
cin >> c[i] >> l[i];
num_right += c[i];
loss1 += c[i] * i;
loss2 += c[i] * l[i];
}
int mx_ix, mx_loss = 1e9;
for ( int i = 1; i <= n; i ++ ) {
loss1 += num_left - num_right;
int t_loss = loss1 + loss2 - c[i] * l[i];
if ( t_loss < mx_loss ) {
mx_loss = t_loss;
mx_ix = i;
}
num_right -= c[i];
num_left += c[i];
}
cout << mx_ix << ' ' << mx_loss << endl;
return 0;
}