Submission #1026932

---

Source Code Expand

#define DEB
#include<bits/stdc++.h>
#define REP(i,m) for(int i=0;i<(m);++i)
#define REPN(i,m,in) for(int i=(in);i<(m);++i)
#define ALL(t) (t).begin(),(t).end()
#define CLR(a) memset((a),0,sizeof(a))
#define pb push_back
#define mp make_pair
#define fr first
#define sc second

using namespace std;


#ifdef DEB
#define dump(x)  cerr << #x << " = " << (x) << endl
#define prl cerr<<"called:"<< __LINE__<<endl
#define dumpR(x) cerr<<"\x1b[31m"<<#x<<" = " <<(x)<<"\x1b[39m"<<endl
#define dumpY(x) cerr<<"\x1b[33m"<<#x<<" = " <<(x)<<"\x1b[39m"<<endl
#define dumpG(x) cerr<<"\x1b[32m"<<#x<<" = " <<(x)<<"\x1b[39m"<<endl
template<class T> void debug(T a,T b){ for(;a!=b;++a) cerr<<*a<<' ';cerr<<endl;}
#else
#define dump(x) ;
#define dumpR(x) ;
#define dumpY(x) ;
#define dumpG(x) ;
#define prl ;
template<class T> void debug(T a,T b){ ;}
#endif

template<class T> void chmin(T& a,const T& b) { if(a>b) a=b; }
template<class T> void chmax(T& a,const T& b) { if(a<b) a=b; }

typedef long long int lint;
typedef pair<int,int> pi;

namespace std{
  template<class S,class T>
  ostream &operator <<(ostream& out,const pair<S,T>& a){
    out<<'('<<a.fr<<','<<a.sc<<')';
    return out;
  }
}

const lint INF=1e18;

int n;
pi range[5005];
lint dp[5005][5005];
int main(){
  cin>>n;
  REP(i,n) cin>>range[i].fr>>range[i].sc;
  sort(range,range+n,[&](pi a,pi b ){
    return a.fr+a.sc>b.fr+b.sc;
  });

  REP(i,5005) REP(j,5005) dp[i][j]=INF;

  int m=(n+1)/2;
  dp[0][0]=0;

  REP(i,m+1) REP(j,m+1) if(dp[i][j]<INF){
    pi r=range[i+j];
    lint sum=r.fr+r.sc;
    if(n&1 && i+1==m) chmin(dp[i+1][j],dp[i][j]+sum*i);
    else chmin(dp[i+1][j],dp[i][j]+sum*i+r.sc);
    if(n&1 && j+1==m) chmin(dp[i][j+1],dp[i][j]+sum*j);
    else chmin(dp[i][j+1],dp[i][j]+sum*j+r.fr);
  }
  lint res=INF;
  REP(i,m+1) REP(j,m+1) if(i+j==n) chmin(res,dp[i][j]);
  cout<<res<<endl;
  return 0;
}

Submission Info

Judge Result