Pagini recente » Cod sursa (job #1074911) | Cod sursa (job #227806) | Cod sursa (job #1211361) | Cod sursa (job #1887567) | Cod sursa (job #2585154)
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("bilute.in");
ofstream fout("bilute.out");
int N;
int C[30001], L[30001];
int TIME, TIME_MAX = INT_MAX, poz;
int main() {
fin >> N;
for (int i = 0; i < N; ++i) {
fin >> C[i] >> L[i];
}
for (int i = 0; i < N; ++i) {
TIME = 0;
for (int j = 0; j < N; ++j) {
if (i != j) {
if(i > j)
TIME = TIME + (C[j] * L[j] + C[j] * (i - j));
else TIME = TIME + (C[j] * L[j] + C[j] * (j - i));
}
}
if (TIME < TIME_MAX) {
TIME_MAX = TIME;
poz = i + 1;
}
}
fout << poz << ' ' << TIME_MAX;
}