#include using namespace std; #define ALL(x) begin(x),end(x) #define rep(i,n) for(int i=0;i<(n);i++) #define debug(v) cout<<#v<<":";for(auto x:v){cout<bool chmax(T &a,const T &b){if(abool chmin(T &a,const T &b){if(b ostream &operator<<(ostream &os,const vector&v){ for(int i=0;i<(int)v.size();i++) os< istream &operator>>(istream &is,vector&v){ for(T &x:v)is>>x; return is; } template struct AbsoluteSum{ multiset L,R; T min_f; AbsoluteSum():min_f(0){} // add |x-a| void insert(T a){ if(L.empty() or R.empty()){ L.insert(a); R.insert(a); return ; } T pl=*prev(end(L)),pr=*begin(R); L.insert(a); R.insert(a); if(pl<=a and a<=pr) return ; // 端をswapするだけでいい if(*prev(end(L))>*begin(R)){ T cl=*prev(end(L)),cr=*begin(R); L.erase(L.find(cl)); R.erase(R.find(cr)); R.insert(cl); L.insert(cr); } min_f+=std::min(abs(pl-a),abs(pr-a)); return ; } // erase |x-a| void erase(T a){ if(L.find(a)!=end(L) and R.find(a)!=end(R)){ L.erase(L.find(a)); R.erase(R.find(a)); return ; } if(L.find(a)!=end(L)){ L.erase(L.find(a)); L.erase(L.find(a)); L.insert(*begin(R)); R.erase(begin(R)); }else{ R.erase(R.find(a)); R.erase(R.find(a)); R.insert(*prev(end(L))); L.erase(prev(end(L))); } T l=*prev(end(L)),r=*begin(R); if(l<=a and a<=r) return ; min_f-=std::min(abs(l-a),abs(r-a)); return ; } T min(){return min_f;} T operator()(T x){ T ret=min_f; for(const auto &a:L) ret+=max(a-x,T(0)); for(const auto &b:R) ret+=max(x-b,T(0)); return ret; } }; signed main(){ int n;cin>>n; vector v(n); cin>>v; sort(ALL(v)); if(v[0]==v.back()){ cout<<1< f; vector dp(n,0); rep(i,n){ f.insert(v[i]); dp[i]=f.min(); } rep(i,n){ f.erase(v[i]); dp[i]+=f.min(); } cout<<*min_element(ALL(dp))<