Sicily 14515. Cookie Selection

Sicily 14515. Cookie Selection

题目

思路

用两个堆来放全部数就好了；
每个堆放一半；
题目说得这么长几个意思- -。

代码

#include <queue>
#include <vector>
#include <functional>
#include <stdio.h>
using namespace std;

int main() {

    priority_queue<int> FirstHalfPart;
    priority_queue<int, vector<int>, greater<int> > SecondHalfPart;
    char c[20];

    while (~scanf("%s", c)) {
        if (c[0] == ‘#‘) {
            printf("%d\n", FirstHalfPart.top());
            FirstHalfPart.pop();
            if (!SecondHalfPart.empty()
                && FirstHalfPart.size() <= SecondHalfPart.size()) {
                FirstHalfPart.push(SecondHalfPart.top());
                SecondHalfPart.pop();
            }
        }
        else {
            int size = 0;
            for (int i = 0; c[i] != ‘\0‘; i++) size = 10 * size + c[i] - ‘0‘;
            if (!FirstHalfPart.empty() && size > FirstHalfPart.top()) {
                SecondHalfPart.push(size);
                if (!SecondHalfPart.empty()
                    && FirstHalfPart.size() <= SecondHalfPart.size()) {
                    FirstHalfPart.push(SecondHalfPart.top());
                    SecondHalfPart.pop();
                }
            }
            else {
                FirstHalfPart.push(size);
                if (FirstHalfPart.size() > SecondHalfPart.size() + 2)
                {
                    SecondHalfPart.push(FirstHalfPart.top());
                    FirstHalfPart.pop();
                }
            }
        }
    }

    return 0;
}