제출 #7916

#제출 시각아이디문제언어결과실행 시간메모리
7916gs14004허수아비 (JOI14_scarecrows)C++98
15 / 100
4000 ms2648 KiB
#include <cstdio>
#include <algorithm>
struct abi{int x,y;}a[200005];
int n;
long long res;
int cmp(abi p, abi q){return p.x<q.x;}

int main(){
    scanf("%d",&n);
    for (int i=0; i<n; i++) {
        scanf("%d %d",&a[i].x,&a[i].y);
    }
    std::sort(a,a+n,cmp);
    int lower,upper;
    for (int i=0; i<n; i++) {
        lower=a[i].y;
        upper=1987654321;
        for (int j=i+1; j<n; j++) {
            if(upper>a[j].y && a[j].y>lower){
                upper=a[j].y;
                res++;
            }
        }
    }
    printf("%lld",res);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...