Follow me--挑战程序与设计
来源:互联网 发布:优化你的大脑魔力pdf 编辑:程序博客网 时间:2024/06/16 20:55
Description
Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needsN (1 ≤ N ≤ 20,000) planks of wood, each having some integer lengthLi (1 ≤ Li ≤ 50,000) units. He then purchases a single long board just long enough to saw into theN planks (i.e., whose length is the sum of the lengths Li). FJ is ignoring the "kerf", the extra length lost to sawdust when a sawcut is made; you should ignore it, too.
FJ sadly realizes that he doesn't own a saw with which to cut the wood, so he mosies over to Farmer Don's Farm with this long board and politely asks if he may borrow a saw.
Farmer Don, a closet capitalist, doesn't lend FJ a saw but instead offers to charge Farmer John for each of theN-1 cuts in the plank. The charge to cut a piece of wood is exactly equal to its length. Cutting a plank of length 21 costs 21 cents.
Farmer Don then lets Farmer John decide the order and locations to cut the plank. Help Farmer John determine the minimum amount of money he can spend to create theN planks. FJ knows that he can cut the board in various different orders which will result in different charges since the resulting intermediate planks are of different lengths.
Input
Lines 2..N+1: Each line contains a single integer describing the length of a needed plank
Output
Sample Input
3858
Sample Output
34
Hint
The original board measures 8+5+8=21. The first cut will cost 21, and should be used to cut the board into pieces measuring 13 and 8. The second cut will cost 13, and should be used to cut the 13 into 8 and 5. This would cost 21+13=34. If the 21 was cut into 16 and 5 instead, the second cut would cost 16 for a total of 37 (which is more than 34).
#include <queue>
#include <algorithm>
#include <cstring>
#include <cstdio>
{
int n;
cin>>n;
long long ans=0;
priority_queue<int ,vector<int>,greater<int> >q;
for (int i=0;i<n;i++)
{
int temp;
cin>>temp;
q.push(temp);
}
while(q.size()>1)
{
int l1=q.top();
q.pop();
int l2=q.top();
q.pop();
ans+=l1+l2;
q.push(l1+l2);
}
cout<<ans<<endl;
return 0;
}
- Follow me 挑战程序与设计
- Follow me 挑战程序与设计
- Follow me 挑战程序与设计
- Follow me 挑战程序与设计
- Follow me--挑战程序与设计
- Follow me--挑战程序与设计
- follow me
- Follow me on Twitter !
- Follow Me: ArcPy(1)
- Follow Me: ArcPy(2)
- mongodb CURD follow me
- 加壳程序CPU-FOLLOW ME测试版(含源码)已经发布
- Objective-C 学习Follow Me(一)
- Python挑战第四关follow the chain
- 软件项目管理Follow Me--如何进行项目估算
- 项目管理Follow Me – MS Project使用经验谈
- Follow Me:深入浅出学习Hibernate一:Hibernate概述
- Follow Me:深入浅出学习Hibernate二:Hibernate第一实例
- Linux基础之swap分区
- web 学习笔记3-JavaScript
- Comet基于 HTTP 长连接的“服务器推”技术
- 伪类中(:before 为例)添加添加图片方法
- 对线性回归,logistic回归和一般回归的认识
- Follow me--挑战程序与设计
- Floodlight在Linux环境下运行时MatchUtils报错
- Kafka笔记一之简介,安装
- 多相流的相关概念
- HDU 2546 饭卡 (01背包--经典题型!)
- ES6--Set、Map、Symbol、Proxy及Reflect
- 三种C/C++创建文件夹的方法
- htaccess-rewrite 详解
- 将二叉树拆成链表