# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
73030 | MKopchev | Teams (IOI15_teams) | C++14 | 0 ms | 0 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<bits/stdc++.h>
#include "teams.h"
using namespace std;
int n;
vector< pair<int,int> > inp;
void init(int N,vector<int> A,vector<int> B)
{
n=N;
for(int i=0;i<N;i++)
inp.push_back({A[i],B[i]});
sort(inp.begin(),inp.end());
}
priority_queue<int> q,idle;
bool call(int m,vector<int> k)
{
q=idle;
sort(k.begin(),k.end());
int pos=0;
for(auto p:k)
{
while(pos<n&&
inp[pos].first<=p)
{q.push(-inp[pos].second);pos++;}
while(q.size()&&-q.top()<p)q.pop();
//cout<<p<<" -> "<<q.size()<<endl;
if(q.size()<p)return 0;
for(int i=1;i<=p;i++)
q.pop();
}
return 1;
}
/*
int main()
{
init(4,{1,2,2,2},{2,3,3,4});
cout<<call(2,{1,3})<<endl;
cout<<call(2,{1,1})<<endl;
}
*/