【HDOJ6645】Stay Real（堆）

题意：给定一个n个点的堆，每个点有一个值a[i]，每个点必须将在其所有儿子被取之后才能被取

有两个人都按最佳策略行动，问结束之后两人分别取的值之和

n<=1e5，1<=a[i]<=1e9

思路：

 #include<bits/stdc++.h>
 using namespace std;
 typedef long long ll;
 typedef unsigned int uint;
 typedef unsigned long long ull;
 typedef pair<int,int> PII;
 typedef pair<ll,ll> Pll;
 typedef vector<int> VI;
 typedef vector<PII> VII;
 #define N  110000
 #define M  4100000
 #define fi first
 #define se second
 #define MP make_pair
 #define pi acos(-1)
 #define mem(a,b) memset(a,b,sizeof(a))
 #define rep(i,a,b) for(int i=(int)a;i<=(int)b;i++)
 #define per(i,a,b) for(int i=(int)a;i>=(int)b;i--)
 #define lowbit(x) x&(-x)
 #define Rand (rand()*(1<<16)+rand())
 #define id(x) ((x)<=B?(x):m-n/(x)+1)
 #define ls p<<1
 #define rs p<<1|1

 const ll MOD=,inv2=(MOD+)/;
       double eps=1e-;
       int INF=1e9;

 priority_queue<pair<int,int> > q;

 ll s[N];
 int a[N],f[N];

 int read()
 {
    int v=,f=;
    char c=getchar();
    while(c<||<c) {if(c=='-') f=-; c=getchar();}
    while(<=c&&c<=) v=(v<<)+v+v+c-,c=getchar();
    return v*f;
 }

 int main()
 {
     //freopen("1.in","r",stdin);
     int cas=read();
     while(cas--)
     {
         int n=read();
         rep(i,,n) f[i]=;
         rep(i,,n)
         {
             a[i]=read();
             f[i>>]++;
         }
         rep(i,,n)
          if(!f[i]) q.push(MP(a[i],i));
         s[]=s[]=;
         int k=;
         while(!q.empty())
         {
             int u=q.top().se;
             s[k]+=q.top().fi;
             q.pop();
             f[u>>]--;
             if(!f[u>>]) q.push(MP(a[u>>],u>>));
             k^=;
         }

         printf("%I64d %I64d\n",s[],s[]);
     }

     return ;
 }