제출 #668545

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
668545		alvingogo	팀들 (IOI15_teams)	C++14	0 / 100	4062 ms	28180 KiB

teams

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

vector<pair<int,int> > c;
int n,m;
void init(int N,int A[],int B[]){
	n=N;
	for(int i=0;i<n;i++){
		c.push_back({A[i],B[i]});
	}
	sort(c.begin(),c.end());
}
int can(int M,int K[]){
	m=M;
	sort(K,K+M);
	set<int> s;
	int u=0;
	long long sum=0;
	for(int i=0;i<m;i++){
		sum+=K[i];
	}
	if(sum>n){
		return 0;
	}
	for(int i=0;i<m;i++){
		while(u<n && c[u].fs<=K[i]){
			s.insert(c[u].sc);
			u++;
		}
		while(s.size() && *s.begin()<K[i]){
			s.erase(s.begin());
		}
		for(int j=0;j<K[i];j++){
			if(!s.size()){
				return 0;
			}
			s.erase(s.begin());
		}
	}
	return 1;
}

• Subtask 1: 0 / 21
• Subtask 2: 0 / 13
• Subtask 3: 0 / 43
• Subtask 4: 0 / 23