#K10621. Minimum Batch Processing Time

    ID: 23288 Type: Default 1000ms 256MiB

Minimum Batch Processing Time

Minimum Batch Processing Time

In this problem, you are given three integers (t), (f), and (v). You need to compute the minimum total time required to process (t) items, where processing the items in a single batch incurs a fixed overhead time of (f) and a variable time of (v) for each item. The total time is given by the formula: [ T = f + t \times v ] It is always optimal to process all items together in one batch. Use this formula to calculate and output the required time.

inputFormat

The input consists of a single line containing three space-separated integers: (t), (f), and (v), where:

  • \(t\) is the number of items to be processed.
  • \(f\) is the fixed overhead time for processing a batch.
  • \(v\) is the time taken to process each individual item.

outputFormat

Output a single integer representing the minimum total processing time, computed as (f + t \times v).## sample

1000 10 5
5010