题目1107：搬水果

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
using namespace std;
//1107 method 2
priority_queue<int ,vector<int>,greater<int> >Q;
int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        if(n==0)    break;
        while(!Q.empty()) Q.pop();
        for(int i=0;i<n;i++){
            int x;scanf("%d",&x);
            Q.push(x);
        }
        int sum=0;
        while(Q.size()>1){
            int a=Q.top();
            Q.pop();
            int b=Q.top();
            Q.pop();
            sum+=a&