Description: Suppose you want to arrange a number of activities in enough of the hall, and want to use as little as possible venue. Design a greedy algorithm to be arranged. Test programming activities to be arrangements to achieve a given k, calculated using the least venue. The input data, the first line is the value of k, the next k rows, each row has two positive integers, respectively the k be arranged to start time and end time, the time 0:00 minutes. The output of the minimum number of venue.
To Search:
File list (Check if you may need any files):
tanxin\Debug\tanxin.exe
......\.....\tanxin.ilk
......\.....\tanxin.obj
......\.....\tanxin.pch
......\.....\tanxin.pdb
......\.....\vc60.idb
......\.....\vc60.pdb
......\tanxin.cpp
......\tanxin.dsp
......\tanxin.plg
......\Debug
tanxin
Download