Submission #377822

#	Time	Username	Problem	Language	Result	Execution time	Memory
377822		practice101	Art Exhibition (JOI18_art)	C++14	100 / 100	218 ms	20972 KiB

art

#include<bits/stdc++.h>
/*
Created By Tornado2004
*/
using namespace std;

#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define imod(a , n) (a % n + n ) % n

#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
#define inF freopen("marathon.in","r",stdin );
#define outF freopen("marathon.out" , "w" , stdout ) ;
#define sor(v) sort(v.begin() , v.end());
#define print(v) for(auto f : v ) cout << f << " " ;
#define rsor(v) sort(v.rbegin() , v.rend());
#define rev(v) reverse(v.begin() , v.end());
#define scan(v)for(auto &it : v)cin >> it ;

#define ll long long
#define logar(x , y) log(x) / log(y)
#define int ll
#define pii pair<int , int >
const int N = 1e5 + 5  , K = 11 , M = N * 4 ;
const ll MOD = 1e9 + 7   , oo = 1e9 , OO = 1e18 , mod = MOD ;
const double pi = acos(-1) , eps = 1e-6 ;

//37
// (a ^ b / c ) % mod = (a ^ b ) % MOD * (c ^ (mod - 2)) % mod
// ريتني اعدم المود
int di[] = {0 , 0 , 1 , -1};
int dj[] = {1 , -1 , 0 , 0};


int32_t main()
{   //inF;
   // inF;outF;
    fastio;

    int n ;
    cin >> n ;

    vector<pair<int , int > > v(n);

    for(auto &it : v)cin >> it.first >> it.second ;

    sort(v.begin() , v.end());
    int ans = 0 ;
    int sum = 0 ;
    int past = 0 ;

    for(int i = n - 1 ; i >= 0 ; i --){
        if(i != n - 1)sum += v[i].second - (past - v[i].first);

        sum = max(sum , v[i].second);
        past = v[i].first ;
        ans = max(ans , sum);
    }

    cout << ans ;

}

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