Pagini recente » Cod sursa (job #1177472) | Cod sursa (job #2826470) | Cod sursa (job #33085) | Cod sursa (job #1636663) | Cod sursa (job #117419)
Cod sursa(job #117419)
#include <stdio.h>
#include <limits.h>
int n, v[10000];
int abs(int i)
{
if (i > 0) return i;
return -i;
}
int main()
{
freopen("bilute.in","r",stdin);
freopen("bilute.out","w",stdout);
int i, j, c, l, min = INT_MAX, poz = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++)
{
scanf("%d %d", &c, &l);
for (j = 1; j <= n; j++)
if (j != i) v[j] += ((c*l) + (c * abs(i - j)));
}
for (i = 1; i <= n; i++) if (v[i] < min){ min = v[i]; poz = i;}
printf("%d %d\n",poz,min);
return 0;
}