# POJ 3045（递推找规律）

 Time Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %lld & %llu

Description

Farmer John's N (1 <= N <= 50,000) cows (numbered 1..N) are planning to run away and join the circus. Their hoofed feet prevent them from tightrope walking and swinging from the trapeze (and their last attempt at firing a cow out of a cannon met with a dismal failure). Thus, they have decided to practice performing acrobatic stunts.

The cows aren't terribly creative and have only come up with one acrobatic stunt: standing on top of each other to form a vertical stack of some height. The cows are trying to figure out the order in which they should arrange themselves ithin this stack.

Each of the N cows has an associated weight (1 <= W_i <= 10,000) and strength (1 <= S_i <= 1,000,000,000). The risk of a cow collapsing is equal to the combined weight of all cows on top of her (not including her own weight, of course) minus her strength (so that a stronger cow has a lower risk). Your task is to determine an ordering of the cows that minimizes the greatest risk of collapse for any of the cows.

Input

* Line 1: A single line with the integer N.

* Lines 2..N+1: Line i+1 describes cow i with two space-separated integers, W_i and S_i.

Output

* Line 1: A single integer, giving the largest risk of all the cows in any optimal ordering that minimizes the risk.

Sample Input

3
10 3
2 5
3 3

Sample Output

2

Hint

OUTPUT DETAILS:

Put the cow with weight 10 on the bottom. She will carry the other two cows, so the risk of her collapsing is 2+3-3=2. The other cows have lower risk of collapsing.

Riski=sum-si

Riskj=sum+wi-sj

Riski'=sum+wj-si

Riskj'=sum-sj

wj-si>sj

wj-si>wi-sj

wj-si>si

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int N = 50010;
typedef long long LL;
struct node
{
LL w, s, sum;
}p[N];
int cmp(node a,node b)
{
return a.sum<b.sum;
}

int main()
{
int n;
while(scanf("%d", &n)!=EOF)
{
for(int i=0;i<n;i++)
{
scanf("%I64d %I64d", &p[i].w, &p[i].s);
p[i].sum=p[i].w+p[i].s;
}
sort(p,p+n,cmp);
LL ans=-p[0].s, cnt=0;
for(int i=0;i<n;i++)
{
ans=max(ans,cnt-p[i].s);
cnt+=p[i].w;
}
printf("%lld\n",ans);
}
return 0;
}

• 本文已收录于以下专栏：

## hdu Eddy's research II（递推，找规律，打表）

Eddy's research II Problem Description As is known, Ackermann function plays an important ...

## hdu 2050折线分割平面（递推找规律）

Problem Description 我们看到过很多直线分割平面的题目，今天的这个题目稍微有些变化，我们要求的是n条折线分割平面的最大数目。比如，一条折线可以将平面分成两部分，两条折线最多可以...

## CSU 1972: 大梵天的恩赐 <递推，找规律>

1972: 大梵天的恩赐 Submit Page     Summary    Time Limit: 4 Sec     Memory Limit: 128 Mb     Submi...

## BZOJ(本校) 3048 染色 - dp&递推找规律

【问题描述】 最近大大很happy，她制作了一些小旗，小旗都排成一列。现在她有四种颜色，分别为R,B,W,Y。突发奇想的大大决定出个问题考考你。她想知道，n面小旗染色有多少种不同的方案数。这...

## hdu 递推 2050 1290 2563 2064 2077 规律哥

(没有质量，就出数量) 转载出处：http://blog.sina.com.cn/s/blog_7fec19cd01010h60.html   hdu2050 折线分平面: 1.当有n-1条直线...

举报原因： 您举报文章：POJ 3045（递推找规律） 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)