제출 #1089302

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1089302		PanosPask	팀들 (IOI15_teams)	C++14	34 / 100	4051 ms	19048 KiB

teams

#include <bits/stdc++.h>
#include "teams.h"

using namespace std;

typedef pair<int, int> pi;

int N;
vector<pi> students;

void init(int n, int A[], int B[])
{
	N = n;
	students.resize(N);

	for (int i = 0; i < N; i++) {
		students[i] = {A[i], B[i]};
	}

	sort(students.begin(), students.end());
}

int can(int M, int K[])
{
	sort(K, K + M);

	int p = 0;
	priority_queue<int, vector<int>, greater<int>> q;

	for (int i = 0; i < M; i++) {
		while (p < N && students[p].first <= K[i]) {
			q.push(students[p].second);
			p++;
		}

		while (!q.empty() && q.top() < K[i]) {
			q.pop();
		}

		for (int j = 0; j < K[i]; j++) {
			if (q.empty()) {
				return 0;
			}
			q.pop();
		}
	}

	return 1;
}

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