【思维题】【STL n_element】HDU 6040 Hints of sd0061

【题目】http://acm.hdu.edu.cn/showproblem.php?pid=6040

【题意】求序列中第k小的数

【思路】将询问排序，用n_element先解决最大的询问，再在从头到上一个询问的位置用n_element；这个函数会将第n个位置（第n-1大）的数归位，然后他之前的数都比他小，之后的数都比他大。

【代码】

#include<cstdio>
#include<algorithm>
using namespace std;

const int M=1e7+10;
unsigned a[M];
//int b[M];
unsigned n,m,A,B,C;
//unsigned A = A, B = B, C = C;
unsigned rng61()
{
    unsigned t;
    A ^= A << 16;
    A ^= A >> 5;
    A ^= A << 1;
    t = A;
    A = B;
    B = C;
    C = t ^ A ^ B;
    return C;
}

struct node
{
    int id,x;
    unsigned ans;
} ask[105];

bool cmp1(node a,node b)
{
    return a.x>b.x;
}

bool cmp2(node a,node b)
{
    return a.id<b.id;
}

int main()
{
    int cas=1;
    while(~scanf("%d%d%d%d%d",&n,&m,&A,&B,&C))
    {
        for(int i=0; i<n; i++)
        {
            a[i]=rng61();
        }
        //sort(a,a+n);
        for(int i=0; i<m; i++)
        {
            int t;
            scanf("%d",&t);
            ask[i].id=i,ask[i].x=t;
        }
        sort(ask,ask+m,cmp1);
        for(int i=0; i<m; i++)
        {
            if(i==0)
            nth_element(a,a+ask[i].x,a+n);
            else
            nth_element(a,a+ask[i].x,a+ask[i-1].x);

            ask[i].ans=a[ask[i].x];
        }
        sort(ask,ask+m,cmp2);
        printf("Case #%d:",cas++);
        for(int i=0;i<m;i++)
        {
            printf(" %u",ask[i].ans);//注意无符号用%u输出
        }
        puts("");
    }

}