Submission #1087137

---

Source Code Expand

#include<stdio.h>
#include<algorithm>
using namespace std;
struct point {
    int b, e;
    bool operator<(const point &p)const{
        return e-b<p.e-p.b;
    }
}w[5010];
int n;
long long Res, D[5010][5010][2];
int main(){
    int i, j, k;
    scanf("%d",&n);
    for(i=1;i<=n;i++){
        scanf("%d%d",&w[i].b,&w[i].e);
        w[i].b = -w[i].b;
    }
    sort(w+1,w+n+1);
    Res = 1e18;
    for(i=0;i<=n;i++)for(j=0;i+j<=n;j++)for(k=0;k<2;k++)D[i][j][k]=1e18;
    D[0][0][0] = 0;
    for(i=0;i<n;i++){
        for(j=0;j+i<n;j++){
            int x = n-i-j;
            D[i][j][1] = min(D[i][j][1], D[i][j][0] + 1ll*(n/2)*(w[x].e-w[x].b));
            for(k=0;k<2;k++){
                int x = n-i-j-k;
                D[i+1][j][k] = min(D[i+1][j][k], D[i][j][k] + w[x].e + 1ll*(w[x].e-w[x].b)*i);
                D[i][j+1][k] = min(D[i][j+1][k], D[i][j][k] + -w[x].b + 1ll*(w[x].e-w[x].b)*j);
            }
        }
    }
    if(n%2==0){
        for(i=0;i<=n;i++)Res = min(Res, D[i][n-i][0]);
        printf("%lld\n",Res);
    }
    else{
        printf("%lld\n",D[n/2][n/2][1]);
    }
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:14:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
./Main.cpp:16:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&w[i].b,&w[i].e);
                                      ^

Judge Result