HDU 4883 TIANKENG’s restaurant
来源:互联网 发布:科比00年总决赛数据 编辑:程序博客网 时间:2024/05/01 03:56
Problem Description
TIANKENG manages a restaurant after graduating from ZCMU, and tens of thousands of customers come to have meal because of its delicious dishes. Today n groups of customers come to enjoy their meal, and there are Xi persons in the ith group in sum. Assuming that each customer can own only one chair. Now we know the arriving time STi and departure time EDi of each group. Could you help TIANKENG calculate the minimum chairs he needs to prepare so that every customer can take a seat when arriving the restaurant?
Input
The first line contains a positive integer T(T<=100), standing for T test cases in all.
Each cases has a positive integer n(1<=n<=10000), which means n groups of customer. Then following n lines, each line there is a positive integer Xi(1<=Xi<=100), referring to the sum of the number of the ith group people, and the arriving time STi and departure time Edi(the time format is hh:mm, 0<=hh<24, 0<=mm<60), Given that the arriving time must be earlier than the departure time.
Pay attention that when a group of people arrive at the restaurant as soon as a group of people leaves from the restaurant, then the arriving group can be arranged to take their seats if the seats are enough.
Each cases has a positive integer n(1<=n<=10000), which means n groups of customer. Then following n lines, each line there is a positive integer Xi(1<=Xi<=100), referring to the sum of the number of the ith group people, and the arriving time STi and departure time Edi(the time format is hh:mm, 0<=hh<24, 0<=mm<60), Given that the arriving time must be earlier than the departure time.
Pay attention that when a group of people arrive at the restaurant as soon as a group of people leaves from the restaurant, then the arriving group can be arranged to take their seats if the seats are enough.
Output
For each test case, output the minimum number of chair that TIANKENG needs to prepare.
Sample Input
226 08:00 09:005 08:59 09:5926 08:00 09:005 09:00 10:00
Sample Output
116
Source
BestCoder Round #2
题意:求最少需要的椅子数
思路:贪心,开始的是+,结束的是-
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#include <vector>using namespace std;const int maxn = 1000005;struct E {int num;int e;} brr[maxn];int cmp(E a, E b) {if (a.e != b.e)return a.e < b.e;return a.num < b.num;}int main() {int t, n;scanf("%d", &t);while (t--) {int cnt = 0;int num, a, b, c, d;scanf("%d", &n);for (int i = 1; i <= n; i++) {scanf("%d %d:%d %d:%d", &num, &a, &b, &c, &d);brr[cnt].num = num;brr[cnt++].e = a*100+b;brr[cnt].num = -num;brr[cnt++].e = c*100+d;}sort(brr, brr+cnt, cmp);int ans = 0;int Max = -1;for (int i = 0; i < cnt; i++) {ans += brr[i].num;Max = max(ans, Max);}printf("%d\n", Max);}return 0;}
0 0
- HDU 4883 TIANKENG’s restaurant
- hdu 4883 TIANKENG’s restaurant
- HDU 4883 TIANKENG’s restaurant
- hdu 4883 TIANKENG’s restaurant
- hdu 4883 TIANKENG’s restaurant
- HDU-4883-TIANKENG’s restaurant
- hdu 4883 TIANKENG’s restaurant
- HDU 4883 TIANKENG’s restaurant
- HDU 4883 TIANKENG’s restaurant
- hdu TIANKENG’s restaurant
- TIANKENG’s restaurant HDU
- hdu 4883 (Best Coder) TIANKENG’s restaurant
- HDU 4883 TIANKENG’s restaurant(区间选点)
- hdu 4883 TIANKENG’s restaurant(区间选点)
- 【HDU】4883 TIANKENG’s restaurant 标记法
- HDU 4883 TIANKENG’s restaurant (贪心)
- HDU 4883 TIANKENG’s restaurant(模拟)
- [ACM] HDU 4883 TIANKENG’s restaurant
- hdu 1853 Cyclic Tour && hdu 3435 A new Graph Game(简单KM算法)
- cocos2d-x-3.0移植android
- QThread的使用总结(2)
- ubuntu 安装gcc pcre
- Single Round Match
- HDU 4883 TIANKENG’s restaurant
- 使用rgba属性兼容IE8
- 九度OJ 1021统计字符----20140728
- 炒冷饭系列:设计模式 单例模式
- poj 2006 Litmus Test 【即zoj 2351:计算酸的PH】
- iOS的一些理解
- Spring MVC使用fastjson数据传到前台中文乱码解决
- Cloudera Manager 和 CDH 4 终极安装
- Passing address of non-local object to __autoreleasing parameter for write-back