hdu4882 ZCC Loves Codefires（贪心）

Though ZCC has many Fans, ZCC himself is a crazy Fan of a coder, called "Memset137".
 It was on Codefires(CF), an online competitive programming site, that ZCC knew Memset137, and immediately became his fan. 
But why? 
 Because Memset137 can solve all problem in rounds, without unsuccessful submissions; his estimation of time to solve certain problem is so accurate, that he can surely get an Accepted the second he has predicted. He soon became IGM, the best title of Codefires. Besides, he is famous for his coding speed and the achievement in the field of Data Structures. 
 After become IGM, Memset137 has a new goal: He wants his score in CF rounds to be as large as possible. 
 What is score? In Codefires, every problem has 2 attributes, let's call them Ki and Bi(Ki, Bi＞0). if Memset137 solves the problem at Ti-th second, he gained Bi-Ki*Ti score. It's guaranteed Bi-Ki*Ti is always positive during the round time. 
 Now that Memset137 can solve every problem, in this problem, Bi is of no concern. Please write a program to calculate the minimal score he will lose.(that is, the sum of Ki*Ti). 

InputThe first line contains an integer N(1≤N≤10^5), the number of problem in the round. 
 The second line contains N integers Ei(1≤Ei≤10^4), the time(second) to solve the i-th problem. 
 The last line contains N integers Ki(1≤Ki≤10^4), as was described.OutputOne integer L, the minimal score he will lose.Sample Input

3
10 10 20
1 2 3

Sample Output

150


        
  

Hint

Memset137 takes the first 10 seconds to solve problem B, then solves problem C at the end of the 30th second. Memset137 gets AK at the end of the 40th second.
L = 10 * 2 + (10+20) * 3 + (10+20+10) * 1 = 150. 
        
 

很有趣的题目，推导一下公式就会发现只要相邻的两个题目a.t*b.k < b.t*a.k就可以使得最小。 用了sort。

 

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define ll long long
using namespace std;
const int mx = 1e5+10; 
int n;
struct tk{
	int t,k;
}no[mx];

bool cmp(tk a, tk b){
	return a.t*b.k < b.t*a.k; 
}

int main(){
  while(scanf("%d", &n) != EOF){
  	for(int i = 0; i < n; i++)
  	   scanf("%d", &no[i].t);
  	for(int i = 0; i < n; i++)
  	   scanf("%d", &no[i].k);
  	sort(no,no+n,cmp);
  
  	ll t = no[0].t;
  	ll sum = t * no[0].k;
  	for(int i = 1; i<n; i++){
  		t += no[i].t;
		sum += no[i].k * t;
	  }
	  
	cout<<sum<<endl;
  }	


return 0;
}