poj 3399 巨坑

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
int main()
{
    int n,m,i,tp;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        priority_queue<int> que1,res;
        priority_queue<int,vector<int>,greater<int> > que2;
        for(i=0;i<n;i++)
        {
            scanf("%d",&tp);
            if(tp<0)
                que2.push(tp);
            else
                que1.push(tp);
        }
        if(m&1)
            if(que1.size())
            {
                res.push(que1.top());
                que1.pop();
            }
            else
            {
                while(que2.size()>m)
                    que2.pop();
                while(que2.size())
                {
                    res.push(que2.top());
                    que2.pop();
                }
            }
        while(res.size()<m)
        {
            if(que2.size()<2)
            {
                if(que1.size())
                {
                    res.push(que1.top());
                    que1.pop();
                }
                else
                {
                    res.push(que2.top());
                    que2.pop();
                }
            }
            else
            {
                if(que1.size()<2)
                {
                    res.push(que2.top());
                    que2.pop();
                    res.push(que2.top());
                    que2.pop();
                }
                else
                {
                    int tp1,tp2,tp3,tp4;
                    tp1=que1.top();
                    que1.pop();
                    tp2=que1.top();
                    tp3=que2.top();
                    que2.pop();
                    tp4=que2.top();
                    if(tp1*tp2<tp3*tp4)
                    {
                        res.push(tp3);
                        res.push(tp4);
                        que2.pop();
                        que1.push(tp1);
                    }
                    else
                    {
                        res.push(tp1);
                        res.push(tp2);
                        que1.pop();
                        que1.push(tp3);
                    }
                }
            }
        }
        while(res.size()>1)
        {
            printf("%d ",res.top());
            res.pop();
        }
        printf("%d\n",res.top());
        res.pop();
    }
    return 0;
}