#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 time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |