제출 #377045

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
377045		SavicS	Art Exhibition (JOI18_art)	C++14	100 / 100	231 ms	24828 KiB

art

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<ll,ll> pii;
const int maxn = 500005;
const ll inf = 1e18 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n;
pii niz[maxn];

ll pref[maxn];

int main()
{
   	ios::sync_with_stdio(false);
   	cout.tie(nullptr);
  	cin.tie(nullptr);
	cin >> n;
	ff(i,1,n)cin >> niz[i].fi >> niz[i].se;
	sort(niz + 1, niz + n + 1);
	ff(i,1,n)pref[i] = pref[i - 1] + niz[i].se;
   	ll rez = -inf;
   	ll mn = inf;	
	ff(i,1,n){
		mn = min(mn, pref[i - 1] - niz[i].fi);
		ll kol = pref[i] - niz[i].fi - mn;
		rez = max(rez, kol);
	}
   	cout << rez << endl;
   	return 0;
}
/**

3
2 3
11 2
4 5


// probati bojenje sahovski ili slicno

**/

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