ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1203. Scientific Conference

It is easy, just sort and one linear cycle
Posted by Sanatbek_Matlatipov 12 Sep 2015 12:15
1. Sort it by endTime, if endTime equals another endTime then sort them by startTime.
2. Open one iteration from 2 to n, init just check that,  is endTime<starTime, if so then ans++;
3. print ans; endTime and startTimes is one array with unchanged same index...

Sorry for poor English
Re: It is easy, just sort and one linear cycle
Posted by ELDVN 16 Nov 2015 12:37
Can u help me? Whats the wrong in my algorithm?
http://ideone.com/V68rxk
Re: It is easy, just sort and one linear cycle
Posted by Dhruv Somani 1 May 2016 22:22
I don't think sorting by startTime is necessary. I think we should reverse-sort by startTime.