제출 #939935

#제출 시각아이디문제언어결과실행 시간메모리
939935ezzzayArt Exhibition (JOI18_art)C++14
10 / 100
4 ms2648 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=5e5+5;
int a[N],b[N];
signed main(){
    int n;
    cin>>n;
    int ans=0;
    for(int i=0;i<n;i++)cin>>a[i]>>b[i];
    for(int i=1;i<(1<<n);i++){
        int x=LLONG_MAX;
        int y=LLONG_MIN;
        int s=0;
        for(int j=0;j<n;j++){
            if(i & (1<<j)){
                x=min(x,a[j]);
                y=max(y,a[j]);
                s+=b[j];
            }
        }
        ans=max(ans,s-(y-x));
    }
    cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...