Submission #1694456

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount

#define INF 1e16

ll n;
ll a[111];
bool used[111];

int main(){
	cin>>n;
  rep(i,n)cin>>a[i];
  sort(a,a+n);
  ll res=INF;
  rep(i,n)rep(j,i){
    ll mina=a[i]+a[j];
    set<P> st;
    memset(used,0,sizeof(used));
    used[i]=used[j]=true;
    rep(k,n){
      if(used[k])continue;
      st.insert(P(a[k],k));
    }
    ll maxa=-1;
    bool ok=true;
    for(ll k=n-1;k>=0;k--){
      if(used[k])continue;
      st.erase(P(a[k],k));
      auto c=st.lower_bound(P(mina-a[k],-1));
      if(c==st.end()){
        ok=false;
        break;
      }
      maxch(maxa,a[k]+(*c).fi);
      used[k]=used[(*c).se]=true;
      st.erase(c);
      //dbg(k); dbg((*c).se);
    }
    if(!ok)continue;
    minch(res,maxa-mina);
  }
  cout<<res<<endl;
	return 0;
}

Submission Info

Judge Result