CodeForces 588A Duff and Meat 贪心

原创 2015年11月18日 15:12:37

Malek第i天需要a[i]单位的肉,第i天的肉价为p[i]每单位,求最小总花费。

如果把p看作一个函数,那么对于每个“极小值”,买光到下一次和它相等花费的那一天。

配图和题目一点关系都没有。。。。

#include <cstdio>
#include <algorithm>
using namespace std;
#define FOR(i,j,k) for(i=j;i<=k;i++)
const int N = 100001;
int a[N], p[N], r[N], buy[N];
int cmp(int x, int y) {
    return p[x]<p[y];
}
int main() {
    int n, i, ans=0,j; scanf("%d", &n);
    FOR(i,1,n) scanf("%d%d", a+i,p+i),r[i]=i;
    sort(r+1,r+1+n,cmp);
    FOR(i,1,n) for(j=r[i];!buy[j]&&j<=n;j++) buy[j]=p[r[i]];
    FOR(i,1,n) ans+=a[i]*buy[i];
    printf("%d", ans);
    return 0;
}


 

A. Duff and Meat
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard 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.

Sample test(s)
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.



版权声明:转载请注明 http://blog.csdn.net/huanghongxun/

相关文章推荐

codeforces 588 A Duff and Meat

A. Duff and Meat time limit per test 1 second memory limit per test 256 megabytes i...

Duff and Meat(贪心)

A. Duff and Meat time limit per test 1 second memory limit per test 256 megabytes i...

Codeforces Round #326 (Div. 2) A. Duff and Meat

A. Duff and Meat time limit per test 1 second memory limit per test 256 megabytes input ...

Codeforces 588 C. Duff and Weight Lifting

C. Duff and Weight Lifting time limit per test 1 second memory limit per test 256 megaby...

Codeforces 588 C Duff and Weight Lifting【思维】

C. Duff and Weight Lifting time limit per test 1 second memory limit per test 256 megabytes inp...

Codeforces 588B Duff in Love【暴力】水题

B. Duff in Love time limit per test 2 seconds memory limit per test 256 megabytes input ...

Code Forces 587A - Duff and Weight Lifting(贪心)

题目大意:达夫练习举重,给他n个哑铃,他每次能举起重量满足$2^{a1}+2^{a2}+...+2^{an}=2^x$.的哑铃。求他需要多少次才能将哑铃举完。第一行输入n表示哑铃总数,第二行输入的表示...

codeforces-587A-Duff and Weight Lifting

codeforces-587A-Duff and Weight Lifting

Codeforces Round #326 (Div. 2)587A. Duff and Weight Lifting

解题报告:Codeforces Round #326 (Editorial) A. Duff and Weight Lifting time limit per test 1 seco...

ds 11.4 Fresh_Meat (优先队列+贪心)

贪心+优先队列
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)