sorting_structure.cpp

#include <bits/stdc++.h>
using namespace std;
struct job
{
    int start;
    int end;
};
bool sorting(job const& lhs, job const& rhs)
{
    if (lhs.start != rhs.start)
        return lhs.start < rhs.start;
        else
        return true;
}
int main() {
	
	int n;
	cin>>n;
	struct job a[n];
	for(int i=0;i<n;i++)
	{
	    cin>>a[i].start>>a[i].end;
	}
	
	sort(a,a+n,sorting);
	
		for(int i=0;i<n;i++)
	{
	    cout<<a[i].start<<endl<<a[i].end<<endl;
	}
	

	return 0;
}