/*
Given an array of numeric pairs representing the start and end times of scheduled meetings, find the maximum number of meetings that can be held in a room if only one meeting can occur in the room at once.
Example
Input: [(8.5, 9.5), (11, 11.25), (9, 11), (11.5, 13), (10, 10.75), (8, 9)]
Output: 4 (The following meetings can occur in the given order: (8, 9), (10, 10.75), (11, 11.25), 11.5, 13))
 
 
 
*/
 
#include <iostream>
using namespace std;
 
int main() {
	// your code goes here
	return 0;
}

LyoKR2l2ZW4gYW4gYXJyYXkgb2YgbnVtZXJpYyBwYWlycyByZXByZXNlbnRpbmcgdGhlIHN0YXJ0IGFuZCBlbmQgdGltZXMgb2Ygc2NoZWR1bGVkIG1lZXRpbmdzLCBmaW5kIHRoZSBtYXhpbXVtIG51bWJlciBvZiBtZWV0aW5ncyB0aGF0IGNhbiBiZSBoZWxkIGluIGEgcm9vbSBpZiBvbmx5IG9uZSBtZWV0aW5nIGNhbiBvY2N1ciBpbiB0aGUgcm9vbSBhdCBvbmNlLgpFeGFtcGxlCklucHV0OiBbKDguNSwgOS41KSwgKDExLCAxMS4yNSksICg5LCAxMSksICgxMS41LCAxMyksICgxMCwgMTAuNzUpLCAoOCwgOSldCk91dHB1dDogNCAoVGhlIGZvbGxvd2luZyBtZWV0aW5ncyBjYW4gb2NjdXIgaW4gdGhlIGdpdmVuIG9yZGVyOiAoOCwgOSksICgxMCwgMTAuNzUpLCAoMTEsIDExLjI1KSwgMTEuNSwgMTMpKQoKCgoqLwoKI2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglyZXR1cm4gMDsKfQ==