Barney goes to Work

Computer Science Level pending

Barney is a busy guy. He can only afford to come to his office on \(10^2\) days.

However, the Goliath National Bank decided to pay him \($a_i\) if he comes on day \(i\) and fine him \($b_i\) if he misses day \(i\).

This being the lists \(<a_i>\) and \(<b_i>\), for \(n = 10^4 \) days, what is the minimum money Barney could end up loosing?

  • Input Format: Line 1 contains all \(a_i\) sequentially from \(i = 1\) to \(10^4\) and Line 2 contains all the corresponding \(b_i\)

Problem Loading...

Note Loading...

Set Loading...