Pagini recente » Cod sursa (job #2285570) | Cod sursa (job #16947) | Cod sursa (job #1276225) | Cod sursa (job #1978421) | Cod sursa (job #803416)
Cod sursa(job #803416)
#include<fstream>
using namespace std;
ifstream f("bilute.in");
ofstream g("bilute.out");
long long n, C[101], L[101];
int main()
{
int min=20000, c, x;
x=0;
c=0;
f>>n;
for(int i=1; i<=n; i++)
{
f>>C[i]>>L[i];
if(L[i]<min)
min=L[i];
}
for(int i=1; i<=n; i++)
if (L[i]==min) {c=L[i]; break;}
for(int i=1; i<=n; i++)
x=x+C[i]*L[i]+C[i]*abs(i-c);
g<<c<<" "<<x;
return 0;
}