About the n house problem

#1

why int32_t main(), IOS has been used in the video and why sort(a+1, a+n+1) and not sort(a,a+n) has been used?

#2

@aslesha.j7 you can use int or int32_t both will give you same answer here, in case of int32_t it is defined that program will use 32 bit data type while int take data type as per requirement,
IOS is used to take fast input/output
here we have taken array of 1 based indexing so we start sort from iterator 1 hence we use sort(a+1,a+n+1) if you take 0 based indexing you can use sort(a,a+n).

#3

So we can always use IOS for fast input/output then why do we need to reduce our program to efficient time complexity

#4

@aslesha.j7 that IOS written there only helps to fast scan and fast print other codes will run with there usual speed