# 「BZOJ1634」[Usaco2007 Jan] Protecting the Flowers 护花

2014年5月24日2,6076

## Description

Farmer John went to cut some wood and left N (2 <= N <= 100,000) cows eating the grass, as usual. When he returned, he found to his horror that the cows were in his garden eating his beautiful flowers. Wanting to minimize the subsequent damage, FJ decided to take immediate action and transport the cows back to their barn. Each cow i is at a location that is Ti minutes (1 <= Ti <= 2,000,000) away from the barn. Furthermore, while waiting for transport, she destroys Di (1 <= Di <= 100) flowers per minute. No matter how hard he tries,FJ can only transport one cow at a time back to the barn. Moving cow i to the barn requires 2*Ti minutes (Ti to get there and Ti to return). Write a program to determine the order in which FJ should pick up the cows so that the total number of flowers destroyed is minimized.

## Input

* Line 1: A single integer

N * Lines 2..N+1: Each line contains two space-separated integers, Ti and Di, that describe a single cow’s characteristics

## Output

* Line 1: A single integer that is the minimum number of destroyed flowers

6
3 1
2 5
2 3
3 2
4 1
1 6

86

## 题解

a排在b前面会比b排在a前面更优，所以可以按照这个规则排序模拟

von

gfy

skyler2003

zyh3838438zyh