제출 #1301502

#제출 시각아이디문제언어결과실행 시간메모리
1301502timeflew팀들 (IOI15_teams)C++20
0 / 100
39 ms14964 KiB
#include "teams.h" #include<bits/stdc++.h> using namespace std; #define ll long long int n; pair<int, int> v[500000]; void init(int N, int A[], int B[]) { n=N; for(int i=0; i<n; i++) { v[i].first=A[i]; v[i].second=B[i]; } } int can(int M, int K[]) { int cnt=0; sort(K, K+M); sort(v, v+M); for(int i=0; i<M; i++) { if(!(K[i]>=v[i].first&&v[i].second>=K[i])) return 0; } return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...