Submission #1358948

#TimeUsernameProblemLanguageResultExecution timeMemory
1358948kismisArt Exhibition (JOI18_art)C++20
0 / 100
0 ms344 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vt vector 
#define pb push_back
#define pob pop_back
#define endl '\n'
#define fi first
#define se second

signed main(){
    int n;
    cin >> n;
    vt<pair<int , int>> a(n+1);
    for(int i=1 ; i<=n ; i++)
    cin >> a[i].fi >> a[i].se;
    sort(a.begin() , a.end());
    for(int i=2 ; i<=n ; i++)
    a[i].se += a[i-1].se;
    int ans = LLONG_MIN;
   for(int i=n ; i>=1 ; i--)
      ans = max(ans , a[i].se - a[i].fi + a[1].fi);
    cout << ans << endl;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...