from functools import reduce
import sys, os
import math
from collections import Counter
TC = False
class Meat():
def __init__(self) -> None:
self.day = 0
self.price = 0
def solve():
N = int(input())
meats = [Meat() for _ in range(N)]
for i in range(N):
meats[i].day, meats[i].price = map(int, input().split())
price = meats[0].day*meats[0].price
x = meats[0].price
for i in range(1, N):
if meats[i].price < x:
price += meats[i].day*meats[i].price
x = meats[i].price
else:
price += meats[i].day*x
print(price)
if os.path.exists('input.txt'):
debug = True
sys.stdin = open("input.txt","r")
if TC:
for _ in range(int(input())):
solve()
else:
solve()
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed;
cout << setprecision(10);
// freopen("timber_input.txt", "r", stdin);
// freopen("timber_output.txt", "w", stdout);
int n, a, p;
while (~scanf("%d", &n))
{
int min = 101;
int ans = 0;
for (int i = 1; i <= n; i++)
{
scanf("%d%d", &a, &p);
if (p <= min)
ans += a * p, min = p;
else
ans += min * a;
}
printf("%d\n", ans);
}
return 0;
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |