Codeforces 588A Duff and Meat 【dp】

题目链接：Codeforces 588A Duff and Meat

A. Duff and Meat
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Duff is addicted to meat! Malek wants to keep her happy for n days. In order to be happy in i-th day, she needs to eat exactly ai kilograms of meat.

There is a big shop uptown and Malek wants to buy meat for her from there. In i-th day, they sell meat for pi dollars per kilogram. Malek knows all numbers a1, …, an and p1, …, pn. In each day, he can buy arbitrary amount of meat, also he can keep some meat he has for the future.

Malek is a little tired from cooking meat, so he asked for your help. Help him to minimize the total money he spends to keep Duff happy for n days.

Input
The first line of input contains integer n (1 ≤ n ≤ 105), the number of days.

In the next n lines, i-th line contains two integers ai and pi (1 ≤ ai, pi ≤ 100), the amount of meat Duff needs and the cost of meat in that day.

Output
Print the minimum money needed to keep Duff happy for n days, in one line.

Examples
input
3
1 3
2 2
3 1
output
10
input
3
1 3
2 1
3 2
output
8
Note
In the first sample case: An optimal way would be to buy 1 kg on the first day, 2 kg on the second day and 3 kg on the third day.

In the second sample case: An optimal way would be to buy 1 kg on the first day and 5 kg (needed meat for the second and third day) on the second day.

题意：第i天买a[i]个物品，单价为p[i]。问你买够n天物品最少花的钱数。

dp[i]表示前i的最低单价。

AC代码：

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5 + 10;
int a[MAXN], p[MAXN];
int dp[MAXN];
int main()
{
    int n; cin >> n;
    for(int i = 1; i <= n; i++ ){
        cin >> a[i] >> p[i];
        if(i == 1) dp[i] = p[i];
        else {
            dp[i] = min(dp[i-1], p[i]);
        }
    }
    LL ans = 0;
    for(int i = 1; i <= n; i++) {
        ans += a[i] * dp[i];
    }
    cout << ans << endl;
    return 0;
}