Submission #699905

#	Time	Username	Problem	Language	Result	Execution time	Memory
699905		Alihan_8	Art Exhibition (JOI18_art)	C++17	100 / 100	195 ms	20816 KiB

art

#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n; cin >> n;
    vector <pair<int,int>> p(n);
    for ( auto &[l, r]: p ) cin >> l >> r;
    sort(all(p));
    vector <int> pref(n+1);
    for ( int i = 1; i <= n; i++ ){
        auto [l, r] = p[i-1];
        pref[i] = pref[i-1]+r;
    }
    priority_queue <int> q;
    int Mx = 0;
    for ( int i = 1; i <= n; i++ ){
        q.push(-pref[i-1]+p[i-1].first);
        Mx = max(Mx, q.top()-p[i-1].first+pref[i]);
    }
    cout << Mx;

	cout << '\n';
}

Compilation message (stderr)

art.cpp: In function 'void IO(std::string)':
art.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
art.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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