codeforces 158B Taxi(贪心小水题)
来源:互联网 发布:c界面编程怎么写 编辑:程序博客网 时间:2024/04/30 06:29
点击打开题目
After the lessons n groups of schoolchildren went outside and decided to visit Polycarpus to celebrate his birthday. We know that thei-th group consists of si friends (1 ≤ si ≤ 4), and they want to go to Polycarpus together. They decided to get there by taxi. Each car can carry at most four passengers. What minimum number of cars will the children need if all members of each group should ride in the same taxi (but one taxi can take more than one group)?
The first line contains integer n (1 ≤ n ≤ 105) — the number of groups of schoolchildren. The second line contains a sequence of integerss1, s2, ..., sn (1 ≤ si ≤ 4). The integers are separated by a space, si is the number of children in thei-th group.
Print the single number — the minimum number of taxis necessary to drive all children to Polycarpus.
51 2 4 3 3
4
82 3 4 4 2 1 3 1
5
In the first test we can sort the children into four cars like this:
- the third group (consisting of four children),
- the fourth group (consisting of three children),
- the fifth group (consisting of three children),
- the first and the second group (consisting of one and two children, correspondingly).
There are other ways to sort the groups into four cars.
题目大意:有n个组,每个组有si人,1=<si<=4的,每辆taxi只能做四个人,并且要求每个组的人坐在一起,求需要的taxi的最小辆数。
贪心策略:先装最接近四个人的,不够四个的再要过来人数少的组拼车。
代码:
#include <iostream>#include<stdlib.h>using namespace std;int cmp(const void *a,const void *b){ return *(int *)b-*(int *)a;}int a[100010];int main(){ int n,i,ans,s,k; while(cin>>n) { for(i=0; i<n; i++) { cin>>a[i]; } ans=0; qsort(a,n,sizeof(a[0]),cmp); for(i=0,s=n-1; i<n; i++) { if(a[i]==0) continue; if(a[i]==4)//四个的先装 { ans++; } else if(a[i]<4)//不足四个再判断 { k=a[i]+a[s]; if(k>4) ans++; else if(k==4) { ans++; a[s]=0; s--; } else if(k<4) { a[s]=0; for(s--;s>=i;s--)//在人数少的组中找到一些组,使得总人数最接近四个 { k+=a[s]; if(k>4) { break; } else if(k==4) { a[s]=0; break; } else { a[s]=0; } } ans++; } } } cout<<ans<<endl; } return 0;}
- codeforces 158B Taxi(贪心小水题)
- codeforces 158B Taxi (贪心)
- 158B Taxi 贪心
- CodeForces 158B taxi
- CodeForces 158B Taxi
- codeforces 158B Taxi
- codeforces 158B(Taxi) Java
- CodeForces 158 B. Taxi(模拟)
- codeforces-158B-Taxi题解
- Problem--158B--Codeforces--Taxi
- 【codeforces】B. Taxi
- Codeforces B. Taxi 算法题解
- CF - 158B - Taxi
- 158B - Taxi
- 158B - Taxi
- CF 158B taxi
- Codeforces 158B(贪心问题)
- CodeForceS#276-B(贪心)
- HIT_Training20140522
- 每个程序员都必读的10篇文章
- BeanCreationException:Error creating bean with name 'sessionFactory' defined in file ...
- Mac下cocos2dx3.1用Cocos IDE写的Lua binding篇01
- qt for android搭建碰到问题及解决办法分享。
- codeforces 158B Taxi(贪心小水题)
- Code Hunt (Microsoft Research)
- 一个iOS 框架介绍:MKNetworkKit
- svn版本库创建,本地文件副本生成使用
- 玩家交互体验—剑网3好友系统
- 自写jquery网页回到顶部效果,渐隐图标,引用js文件即可
- 武汉劳务外包-武汉博智人才首页
- MySQL教程 MySQL - 建库、建表、查询
- 英语这样学最有效------少走弯路的学习方法