D. Recover it!

https://codeforc.es/contest/1176/problem/D

题意：构造a数组；

思路：从大到小先取合数，同时去掉相应的因子(找最小，除一下就是最大)；在素数筛按规则从小取；

#include<algorithm>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=2e6+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}


bool vis[2750131+10];
int pre[2750131+10],b[2750131+10],num[2750131+10];
int cnt=0;
void P()
{
    for(int i=2;i<=2750131;i++)
    {
        if(!vis[i]) pre[++cnt]=i;
        for(int j=i+i;j<=2750131;j+=i) vis[j]=1;
    }
}

int main()
{
    FAST_IO;
    //freopen("input.txt","r",stdin);

    P();
    int n;
    cin>>n;
    int Max=0;
    for(int i=1;i<=2*n;i++) cin>>b[i],num[b[i]]++,Max=max(Max,b[i]);
    for(int i=Max;i>=2;i--)
    {
        if(num[i]>0&&vis[i])
        {
            while(num[i]>0)
            {
                int tmp=0;
                cout<<i<<" ";
                for(int j=2;j<=sqrt(i);j++)
                {
                    if(i%j==0)
                    {
                        tmp=i/j;
                        break;
                    }
                }
                num[i]--;
                num[tmp]--;
            }
        }
    }
    for(int i=2;i<=Max;i++)
    {

        if(num[i]>0)
        {
            while(num[i]>0&&!vis[i])
            {
                cout<<i<<" ";
                num[i]--;
                num[pre[i]]--;
            }
        }
    }
}