Submission #699260

#TimeUsernameProblemLanguageResultExecution timeMemory
699260youssefArt Exhibition (JOI18_art)C++14
0 / 100
0 ms212 KiB
/*
██╗░░░██╗░█████╗░██╗░░░██╗░██████╗░██████╗███████╗███████╗
╚██╗░██╔╝██╔══██╗██║░░░██║██╔════╝██╔════╝██╔════╝██╔════╝
░╚████╔╝░██║░░██║██║░░░██║╚█████╗░╚█████╗░█████╗░░█████╗░░
░░╚██╔╝░░██║░░██║██║░░░██║░╚═══██╗░╚═══██╗██╔══╝░░██╔══╝░░
░░░██║░░░╚█████╔╝╚██████╔╝██████╔╝██████╔╝███████╗██║░░░░░
░░░╚═╝░░░░╚════╝░░╚═════╝░╚═════╝░╚═════╝░╚══════╝╚═╝░░░░░
 */
#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<pair<ll,ll>>art;
   ll sofva=0;
   for(int i=0;i<n;i++)
   {ll siz,va;
       cin>>siz>>va;
       art.push_back({siz,va});sofva+=va;
   }
   sort(art.begin(),art.end());
   reverse(art.begin(),art.end());
   ll mi=art[n-1].fi;
   ll  ma=-1;
   for(int i=0;i<n-1;i++)
   {
       if(sofva-(art[i].fi-mi)>ma)
       {
           ma=sofva-(art[i].fi-mi);
           sofva-=art[i].se;

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

   }
   cout<<ma;




    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...