[C++] STL sort

시간복잡도 : O(n*logn)

 

추가해줘야할 헤더 : #include <algorithm>

 

사용법 : sort(A,A+n); (구조체, 배열)

 

sort(A.begin(),A.end()); (vector 형식)

 

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;
int n;
struct tuple2 {
    long long s,e;
};
tuple2 A[100000+5];
bool sf(tuple2 a,tuple2 b) {
    if(a.e==b.e) {
        return a.s<b.s;
    } else {
        return a.e<b.e;
    }
}
int main()
{
    freopen("input.txt","r",stdin);
    scanf("%d",&n);
    int i,j;
    for(i=0;i<n;i++) {
        scanf("%d %d",&A[i].s,&A[i].e);
    }
    sort(A,A+n,sf);

    return 0;
}