# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
69732 | Vahan | Teams (IOI15_teams) | C++17 | 135 ms | 25884 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "teams.h"
#include<vector>
#include<algorithm>
using namespace std;
struct student{
int l;
int r;
};
student g[600000];
int n;
int cmp(student a,student b)
{
if(a.r<b.r)
return 1;
if(a.r==b.r && a.l<b.l)
return 1;
return 0;
}
void init(int N, int A[], int B[]) {
for(int i=0;i<N;i++)
g[i]={A[i],B[i]};
n=N;
sort(g,g+N,cmp);
}
int can(int M, int K[]) {
sort(K,K+M);
int t=0;
for(int i=0;i<n;i++)
{
Compilation message (stderr)
# | 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... |