Submission #1277966

#	Time	Username	Problem	Language	Result	Execution time	Memory
1277966		turali12	Art Exhibition (JOI18_art)	C++20	10 / 100	5 ms	580 KiB

art

#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define all(x) x.begin(),x.end()
#define pb push_back
#define rall(x) x.rbegin(),x.rend()
const int N=1e6+1,mod=998244353,MOD=1e9+7,INF=9223372036854775807;
/*bool lex(const string &a,const string &b){
    if(a.size()!=b.size())
        return a.size()<b.size();
    return a<b;
}*/
/*bool cmp(const pair<int,int>&a,const pair<int,int>&b){
    if(a.first!=b.first){
        return a.first<b.first;
    }
    return a.second<b.second;
}*/
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    int testcasescount=1;
    //cin>>testcasescount;
    while(testcasescount--){
        int n;
        cin>>n;
        vector<int>a(n),b(n);
        for(int i=0;i<n;i++){
            cin>>a[i]>>b[i];
        }
        int ans=-INF;
        for(int mask=0;mask<(1<<n);mask++){
            int s=0,mx=-INF,mn=INF;
            for(int i=0;i<n;i++){
                if(mask>>i&1){
                    s+=b[i];
                    mx=max(a[i],mx);
                    mn=min(a[i],mn);
                }
            }
            ans=max(ans,s-(mx-mn));
        }
        cout<<ans;
    }
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 50