Submission #300128

#	Time	Username	Problem	Language	Result	Execution time	Memory
300128		CSQ31	Art Exhibition (JOI18_art)	C++14	0 / 100	1 ms	384 KiB

art

#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e8)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int main()
{
	ll n;
	cin>>n;
	vector<PII>art(n);
	ll ans = 0;
	for(int i=0;i<n;i++){
		cin>>art[i].fi>>art[i].se;
	}
	sort(all(art));
	ll pref = 0;
	for(int i=0;i<n;i++){
		int j = i;
		pref+=art[i].se;
		while(j+1<n && art[i].fi == art[j+1].fi){
			j++;
			pref+=art[j].se;
		}
		ans = max(ans,pref-(art[j].fi-art[0].fi));
		i = j;
	}
	cout<<ans;
	
}

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