hdu6168Numbers（第九场模拟）

Numbers

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 864    Accepted Submission(s): 449

Problem Description

zk has n numbers  a1,a2,...,an . For each (i,j) satisfying 1≤i<j≤n, zk generates a new number  (ai+aj) . These new numbers could make up a new sequence  b1，b2,...,bn(n−1)/2 .
LsF wants to make some trouble. While zk is sleeping, Lsf mixed up sequence a and b with random order so that zk can't figure out which numbers were in a or b. "I'm angry!", says zk.
Can you help zk find out which n numbers were originally in a?

 

Input

Multiple test cases(not exceed 10).
For each test case:
∙ The first line is an integer m(0≤m≤125250), indicating the total length of a and b. It's guaranteed m can be formed as n(n+1)/2.
∙ The second line contains m numbers, indicating the mixed sequence of a and b.
Each  ai  is in [1,10^9]

 

Output

For each test case, output two lines.
The first line is an integer n, indicating the length of sequence a;
The second line should contain n space-seprated integers  a1,a2,...,an(a1≤a2≤...≤an) . These are numbers in sequence a.
It's guaranteed that there is only one solution for each case.

 

Sample Input

  
  

   
   6
2 2 2 4 4 4
21
1 2 3 3 4 4 5 5 5 6 6 6 7 7 7 8 8 9 9 10 11
  
  

 

Sample Output

  
  

   
   3
2 2 2
6
1 2 3 4 5 6
  
  

 

Source

2017 Multi-University Training Contest - Team 9

排序b，求出最小的两项，然后在b中删除两项之和的值，重复直到剩下长度为lena

/**
   by z_guibin
*/
#include<cstdio>
#include<iostream>
#include<queue>
#include<vector>
#include<cstring>
#include<cmath>
using namespace std;
const int N=1e5+10;
int arr[N];
int main()
{
    int m;
    while(scanf("%d",&m)!=EOF)
    {
        priority_queue<int,vector<int>,greater<int> >q1;
        priority_queue<int,vector<int>,greater<int> >q2;
        int n;
        for(int i=1; i<=m; i++)
        {
            if(i*(i+1)==m*2)
            {
                n=i;
                break;

            }
        }
        //cout<<n<<endl;
        printf("%d\n",n);
        int a;
        for(int i=0; i<m; i++)
        {
            scanf("%d",&a);
            q1.push(a);
        }
        int cnt=1;
        arr[0]=q1.top(),q1.pop();
        arr[1]=q1.top(),q1.pop();
        q2.push(arr[0]+arr[1]);
        while(!q1.empty())
        {
            while(1)
            {
                if(q1.top()==q2.top())
                {
                    q1.pop();
                    q2.pop();
                }
                if(q2.empty()==true||q2.top()!=q1.top())
                {
                    cnt++;
                    arr[cnt]=q1.top();
                    q1.pop();
                    break;
                }
            }
            if(cnt==n-1)
                break;
            for(int i=0; i<cnt; i++)
            {
                q2.push(arr[cnt]+arr[i]);
            }
        }
        for(int i=0; i<n; i++)
        {
            if(i==0) printf("%d",arr[i]);
            else printf(" %d",arr[i]);
        }
        printf("\n");
    }
    return 0;
}