Submission #699268

#	Time	Username	Problem	Language	Result	Execution time	Memory
699268		youssef	Art Exhibition (JOI18_art)	C++14	0 / 100	1 ms	212 KiB

art

/*
██╗░░░██╗░█████╗░██╗░░░██╗░██████╗░██████╗███████╗███████╗
╚██╗░██╔╝██╔══██╗██║░░░██║██╔════╝██╔════╝██╔════╝██╔════╝
░╚████╔╝░██║░░██║██║░░░██║╚█████╗░╚█████╗░█████╗░░█████╗░░
░░╚██╔╝░░██║░░██║██║░░░██║░╚═══██╗░╚═══██╗██╔══╝░░██╔══╝░░
░░░██║░░░╚█████╔╝╚██████╔╝██████╔╝██████╔╝███████╗██║░░░░░
░░░╚═╝░░░░╚════╝░░╚═════╝░╚═════╝░╚═════╝░╚══════╝╚═╝░░░░░
 */
#include <bits/stdc++.h>
using namespace std;
#define nl "\n"
#define ll long long
#define fi first
#define se second
#define fast  ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int main() {
    fast
    int n;
    cin>>n;
    vector<ll>art;
    map<ll,ll>r;
    ll sofva=0;
    for(int i=0;i<n;i++)
    {ll siz,va;
        cin>>siz>>va;
        art.push_back(siz);sofva+=va;r[siz]=va;
    }
    sort(art.begin(),art.end());
    reverse(art.begin(),art.end());

    ll mi=art[n-1];
    ll  ma=-1;
    for(int i=0;i<n-1;i++)
    {
        if(sofva-(art[i]-mi)>ma)
        {
            ma=sofva-(art[i]-mi);
            sofva-=r[art[i]];

        }else { sofva-=r[art[i]]; continue;}

    }
    cout<<ma;




    return 0;
}

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