# 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;
}

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

## poj3045 贪心，并不是二分

• a1083595345
• 2015年11月28日 16:23
• 504

## Cow Acrobats POJ - 3045 假二分【手动摊手】

• bllsll
• 2017年04月21日 15:31
• 176

## poj 2663 递推问题

• njukingway
• 2014年03月04日 11:40
• 1410

## POJ 3517 找规律、递推

#include"iostream" #include"stdio.h" #include"vector" #include"functional" #include"string" #include...
• qq_32454729
• 2016年08月27日 05:09
• 206

## 【POJ】【今日刷的POJ水题合集】【#1】

• u012732945
• 2014年04月28日 07:11
• 767

## poj 2081 简单递推

#include #include #define N 510000 int dp[N]; int f[10000000]; int main() { int k,n,m,i,j; ...
• u011483306
• 2015年02月06日 19:59
• 422

## POJ ZOJ题目分类

POJ，ZOJ题目分类（多篇整合版，分类很细致，全面） 标签： 题目分类POJ整理 2015-04-18 14:44 1672人阅读 评论(0) 收藏 举报 ...
• qq_33929112
• 2016年08月18日 00:40
• 790

## POJ 1093 Formatting Text(DP)

• zxjcarrot
• 2014年04月05日 18:35
• 592

## hdu3045(斜率dp)

• stay_accept
• 2016年11月28日 11:08
• 357

## 找规律 递推

00011:火车站 查看 提交 统计 提问 总时间限制: 1000ms 内存限制: 1024kB 描述 火车从始发站（称为第1站）开出，在始发站上车的人数为a，...
• nucshiyilang
• 2016年07月20日 23:19
• 219

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