제출 #761954

#제출 시각아이디문제언어결과실행 시간메모리
761954Dan4Life팀들 (IOI15_teams)C++17
0 / 100
4049 ms38260 KiB
#include "teams.h" #include <bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back vector<pair<int,int>> v; int n; multiset<int> S; void init(int N, int a[], int b[]) { for(int i = 0; i < N; i++) v.pb({a[i],b[i]}); sort(begin(v),end(v)); n = N; } int can(int m, int a[]) { if(accumulate(a,a+m,0ll)>n) return 0; sort(a,a+m); int j = 0; S.clear(); for(int i = 0; i < m; i++){ int x = a[i]; while(j<n and v[j].fi<=a[i]) S.insert(v[j].se), j++; while(x--){ auto itr = S.lower_bound(x); if(itr==end(S)) return 0; S.erase(itr); } } return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...