POJ-2388-Who's in the Middle

数据比较小，用快排或堆结构都行。

mysol:

STL 堆 reference:http://www.cplusplus.com/reference/algorithm/make_heap/?kw=make_heap

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

bool comp(const int & a, const int & b)
{
    return a >= b;
}

int main()
{
    int n, i;
    int tmp;

    cin >> n;
    vector v;

    for (i=0;i> tmp;
        v.push_back(tmp);
    }

    make_heap(v.begin(), v.end(), comp);

    for(i=0;i