Welcome   HUNAN NORMAL UNIVERSITY ACM/ICPC Judge Online
Home
FAQs
Problem Set
Practices
Online Contests
Major Exercises
OI Special
Judgement
Submit
Online Status
User Ranklist
Users
Register new
Login
Web Links
Hunan Normal University
College of Information Science and Engineering
会场安排问题
Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB
Total submit users: 68, Accepted users: 39
Problem 11110 : No special judgement
Problem description
  假设要在足够多的会场里安排一批活动,并希望使用尽可能少的会场。

Input
  第一行有1 个正整数k,表示有 k个待安排的活动。接下来的k行中,每行有 2个正整数,分别表示 k个待安排的活动开始时间和结束时间。时间以0点开始的分钟计。 (k < 10000)

Output
  将编程计算出的最少会场数输出。

Sample Input
5 
1 23 
12 28 
25 35 
27 80 
36 50
Sample Output
3 
Submit   Clarifications   Judge Status  Problems  Ranklist 

HUNAN NORMAL UNIVERSITY ACM/ICPC Judge Online, Version 2010.5.5.final.
Web visits:2028 today,12073077 total, since 2010-05-07