제출 #699280

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
699280		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);
vector<pair<int,int>>art;
int n;
ll sofva=0;
ll  ma=-1;
ll re(int index,int i,ll sum)
{
    if(index==i)
    {
        return 0;
    }
    ma=max(ma,sum-(art[index].fi-art[i].fi));
    sum-=art[index].se;
    index-=1;
    return re(index,i,sum);
}
int main() {
    fast
    cin>>n;
    for(int i=0;i<n;i++)
    {int siz,va;
        cin>>siz>>va;
        art.push_back({siz,va});sofva+=va;
    }
    sort(art.begin(),art.end());
    //reverse(art.begin(),art.end());

   int h=sofva;
    for(int i=0;i<n;i++)
    {
       re(n-1,i,h);
       h-=art[i].se;


    }
    cout<<ma;




    return 0;
}

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