Cosuri

#include <bits/stdc++.h>

using namespace std;
ifstream fin("cosuri.in");
ofstream fout("cosuri.out");
int T, N, co[1000005], min1=1000001, min2=1000001, max1, max2;
int main()
{
    int i, nr, j;
    fin>>T>>N;
    for(i=1; i<=2*N; ++i)
    {
        fin>>nr;
        co[i]=nr;
        if(nr<=min1)
        {
            min2=min1;
            min1=nr;
        }
        else if(nr>=min1 && nr<min2)
            min2=nr;
        if(nr>=max1)
        {
            max2=max1;
            max1=nr;
        }
        else if(nr<=max1 && nr>max2)
            max2=nr;
    }
    if(T==1)
    {
        fout<<(min1+min2)<<" "<<(max1+max2);
        return 0;
    }
    sort(co+1,co+1+2*N);
    int ok=1;
    i=1;
    j=2*N;
    nr=co[i]+co[j];
    min1=abs(co[j]-co[i]);
    i++;
    j--;
    while(i<j && ok)
    {
        if(co[i]+co[j]!=nr)
            ok=0;
        if(abs(co[j]-co[i])<min1)
            min1=abs(co[j]-co[i]);
        nr=co[i]+co[j];
        i++;
        j--;
    }
    if(ok)
        fout<<"DA\n"<<min1;
    else
        fout<<"NU";
    return 0;
}