Codeforces-38e Let's go rolling!

Description

On a number axis directed from the left rightwards,NMarbles with coordinatesX_{1 ,?X2 ,?...,?XNAre situated. let's assume that the sizes of the marbles are infinitely small, that is in this task each of them is assumed to be a material point. you can stick pins in some of them and the cost of sticking in the marble numberIIs equalCI, NumberCIMay be negative. after you choose and stick the pins you need, the Marbles will start to roll left according to the rule: if a marble has a pin stuck in it, then the marble doesn't move, otherwise the marble rolls all the way up to the next marble which has a pin stuck in it and stops moving there. if there is no pinned marble on the left to the given unpinned one, it is concluded that the marble rolls to the left to infinity and you will pay an infinitely large fine for it. if no marble rolled infinitely to the left, then the fine will consist of two summands:}

• The sum of the costs of stuck pins;
• The sum of the lengths of the paths of each of the marbles, that is the sum of absolute values of differences between their initial and final positions.

Your task is to choose and pin some marbles in the way that will make the fine for you to pay as little as possible.

Input

The first input line contains an integerN(1? ≤?N? ≤? 3000) which is the number of marbles. The nextNLines contain the descri_ptions of the marbles in pairs of IntegersX_{I,CI(? -? 10^{9? ≤?XI,?CI? ≤? 109). The numbers are space-separated. Each descri_ption is given on a separate line. No two marbles have identical initial positions.}}

Output

Output the single number-the least fine you will have to pay.

Sample Input

Input

32 33 41 2

Output

5

Input

41 73 15 106 1

Output

11

Question: for each position you want and the cost of repairing the point at this point, each ball will roll left to minimize the cost of stopping all balls.

Idea: DP, first process the distance and the distance from the current vertex to the first vertex, and then use DP [I] to represent the minimum cost to the I vertex, if we stop at the J point, we need to calculate the distance and cost of [J, I] all points to J, and then calculate the cost of J repair, and then subtract [J, i] The distance to 1st

#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>using namespace std;typedef long long ll;const ll inf = 1e15;const int maxn = 3005;struct Node {int x, c;bool operator <(const Node &a) const {return x < a.x;}} node[maxn];ll sum[maxn], dp[maxn];int main() {int n;scanf("%d", &n);for (int i = 1; i <= n; i++)scanf("%d%d", &node[i].x, &node[i].c);sort(node+1, node+1+n);sum[0] = 0;memset(dp, 0, sizeof(dp));for (int i = 1; i <= n; i++)sum[i] = sum[i-1] + node[i].x - node[1].x;for (int i = 1; i <= n; i++) {dp[i] = inf;for (int j = 1; j <= i; j++)dp[i] = min(dp[i], dp[j-1]+sum[i]-sum[j-1]-(ll)(node[j].x-node[1].x)*(i-j+1)+node[j].c);}printf("%lld\n", dp[n]);return 0;}