CF 38 E Let's Go Rolling! 【DP】

On a number axis directed from the left rightwards, n marbles with coordinates x1, x2, …, xn are 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 number i is equal to ci, number ci may 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 integer n (1 ≤ n ≤ 3000) which is the number of marbles. The next n lines contain the descriptions of the marbles in pairs of integers xi, ci ( - 109 ≤ xi, ci ≤ 109). The numbers are space-separated. Each description 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.

Examples
Input
3
2 3
3 4
1 2
Output
5
Input
4
1 7
3 1
5 10
6 1
Output
11

题意：给你几个玻璃球的起始位置，你的任务是挡住它们。在初始位置挡住有一个花费cost，否则它会一直向左滚，到停止之前行进的距离都会被计做花费。

贪心了两波凉凉，最后还是只能DP 了。

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int maxn = 3333;
#define LL long long
struct node
{
    LL x,cost;
    friend bool operator < (node a,node b)
    {
        return a.x<b.x;
    }
}a[3333];
LL cost[maxn][maxn];
LL dp[maxn];
int main()
{
   LL n;
   scanf("%lld",&n);
   for(LL i=1;i<=n;i++){
        scanf("%lld%lld",&a[i].x,&a[i].cost);
   }
   sort(a+1,a+1+n);

   for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            cost[j][i]=a[j].x-a[i].x;
        }
        for(int j=i+1;j<=n;j++){
            cost[j][i]+=cost[j-1][i];
        }
   }

   /*for(int i=1;i<=n;i++){
    for(int j=i+1;j<=n;j++){
        printf("%lld  ",cost[j][i]);
    }
    printf("\n");
   }*/
   dp[1]=a[1].cost;
   for(int i=2;i<=n;i++){
        dp[i]=13278126378612783;
        for(int j=1;j<i;j++){
            dp[i]=min(dp[i],dp[j]+cost[i-1][j]+a[i].cost);
        }
   }
    LL Min=13278126378612783;
    for(int i=1;i<=n;i++){
        Min=min(dp[i]+cost[n][i],Min);
    }
    printf("%lld\n",Min);




    return 0;
}