hdu 5437 优先队列

很容易想到的做法，对于每个询问(a,b)，将a之前的人放入优先队列中，然后pop上b次将答案存下来，注意询问要先按照a的大小排好序。

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
using namespace std;

const int N = 200000;
const int M = 300;
char name[N][M];
int ans[N];
int k, m, q, cnt, pn;

struct Node
{
    int id, val;
    bool operator < ( const Node & o ) const
    {
        if ( val != o.val ) return val < o.val;
        return id > o.id;
    }
} node[N];

priority_queue<Node> h;

void init()
{
    cnt = 0;
    pn = 0;
    while ( !h.empty() ) h.pop();
}

struct Q
{
    int a, b;
    bool operator < ( const Q & o ) const
    {
        return a < o.a;
    }
} query[N];

int main ()
{
    for ( int i = 0; i < N; i++ )
    {
        node[i].id = i;
    }
    int t;
    scanf("%d", &t);
    while ( t-- )
    {
        init();
        scanf("%d%d%d", &k, &m, &q);
        for ( int i = 0; i < k; i++ )
        {
            scanf("%s%d", name[i], &node[i].val);
        }
        for ( int i = 0; i < m; i++ )
        {
            scanf("%d%d", &query[i].a, &query[i].b);
        }
        sort( query, query + m );
        for ( int i = 0; i < m; i++ )
        {
            int a = query[i].a, b = query[i].b;
            while ( cnt < a )
            {
                h.push( node[cnt] );
                cnt++;
            }
            for ( int j = 0; j < b && ( !h.empty() ); j++ )
            {
                ans[pn++] = h.top().id;
                h.pop();
            }
        }
        while ( cnt < k )
        {
            h.push( node[cnt] );
            cnt++;
        }
        while ( !h.empty() )
        {
            ans[pn++] = h.top().id;
            h.pop();
        }
        for ( int i = 0; i < q; i++ )
        {
            int tn;
            scanf("%d", &tn);
            tn--;
            printf("%s", name[ans[tn]]);
            if ( i != q - 1 ) putchar(' ');
            else putchar('
');
        }
    }
    return 0;
}