【CF】222 Div.1 B Preparing for the Contest

这样类似的题目不少，很多都是一堆优化条件求最优解，这个题的策略就是二分+贪心。
对时间二分， 对费用采用贪心。

 /* 377B */
 #include <iostream>
 #include <string>
 #include <map>
 #include <queue>
 #include <set>
 #include <stack>
 #include <vector>
 #include <deque>
 #include <algorithm>
 #include <cstdio>
 #include <cmath>
 #include <ctime>
 #include <cstring>
 #include <climits>
 #include <cctype>
 #include <cassert>
 #include <functional>
 #include <iterator>
 #include <iomanip>
 using namespace std;
 //#pragma comment(linker,"/STACK:102400000,1024000")

 #define sti                set<int>
 #define stpii            set<pair<int, int> >
 #define mpii            map<int,int>
 #define vi                vector<int>
 #define pii                pair<int,int>
 #define vpii            vector<pair<int,int> >
 #define rep(i, a, n)     for (int i=a;i<n;++i)
 #define per(i, a, n)     for (int i=n-1;i>=a;--i)
 #define clr                clear
 #define pb                 push_back
 #define mp                 make_pair
 #define fir                first
 #define sec                second
 #define all(x)             (x).begin(),(x).end()
 #define SZ(x)             ((int)(x).size())
 #define lson            l, mid, rt<<1
 #define rson            mid+1, r, rt<<1|1

 typedef struct node_t {
     int x, id;
     node_t() {}
     node_t(int x_, int id_):
         x(x_), id(id_) {}
     friend bool operator< (const node_t& a, const node_t& b) {
         return a.x > b.x;
     }
 } node_t;

 typedef struct student {
     int x, p, id;
     student() {}
     student(int x_, int p_, int id_):
         x(x_), p(p_), id(id_) {}
     friend bool operator< (const student& a, const student& b) {
         return a.x > b.x;
     }
 } student;

 const int maxn = 1e5+;
 int a[maxn];
 int n, m, s;
 node_t N[maxn];
 student S[maxn];

 bool comp(const student& a , const student& b) {
     return a.x > b.x;
 }

 bool judge(int t) {
     priority_queue<int,vi, greater<int> > Q;
     int i, j, k;
     int p;
     int tot = s;

     i = ;    // i for student
     j = ;    // j for Q
     while (j < m) {
         while (i<n && S[i].x>=N[j].x) {
             Q.push(S[i].p);
             ++i;
         }
         if (Q.empty())
             break;
         p = Q.top();
         Q.pop();
         if (p > tot)
             return false;
         tot -= p;
         j += t;
     }

     return j>=m;
 }

 void bfs(int t) {
     priority_queue<pii,vpii, greater<pii> > Q;
     int i, j, k, id;
     int m_;

     i = ;    // i for student
     j = ;    // j for Q
     while (j < m) {
         while (i<n && S[i].x>=N[j].x) {
             Q.push(mp(S[i].p, S[i].id));
             ++i;
         }
         id = Q.top().sec;
         Q.pop();
         m_ = min(m, j+t);
         for (k=j; k<m_; ++k)
             a[N[k].id] = id;
         j += t;
     }
 }

 int main() {
     ios::sync_with_stdio(false);
     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
         freopen("data.out", "w", stdout);
     #endif

     int ans = -;

     scanf("%d %d %d", &n, &m, &s);
     rep(i, , m) {
         scanf("%d", &N[i].x);
         N[i].id = i;
     }
     rep(i, , n) {
         scanf("%d", &S[i].x);
         S[i].id = i+;
     }
     rep(i, , n)
         scanf("%d", &S[i].p);

     sort(N, N+m);
     sort(S, S+n);

     if (S[].x < N[].x) {
         puts("NO");
         return ;
     }

     int l = ;
     int r = m+;
     int mid;

     while (l <= r) {
         mid = (l+r)>>;
         if (judge(mid)) {
             ans = mid;
             r = mid - ;
         } else {
             l = mid + ;
         }
     }

     if (ans > ) {
         puts("YES");
         bfs(ans);
         rep(i, , m)
             printf("%d ", a[i]);
         putchar('\n');
     } else {
         puts("NO");
     }

     #ifndef ONLINE_JUDGE
         printf("time = %d.\n", (int)clock());
     #endif

     return ;
 }