제출 #1273197

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1273197		arkanefury	Art Exhibition (JOI18_art)	C++20	0 / 100	0 ms	336 KiB

art

#include <bits/stdc++.h>
#define sz size()
#define FOR(x, n, m, d) for(int x = n; x <= m; x += d)
#define all(v) v.begin(), v.end()
#define S second
#define F first
#define pb push_back
#define int long long
using namespace std;
const int N = 5e5+5;
int a[N], b[N], c[N], n, l, ans, k;
signed main(){
	cin >> n;
	vector<pair<int, int>>v;
	set<int>st;
	map<int, int>mp;
	FOR(i, 1, n, 1){
	cin >> a[i] >> b[i];
	st.insert(a[i]);
	mp[a[i]] += b[i];
    }
    for(auto i : st)v.pb({i, mp[i]});
	sort(all(v));
	ans = 0;
	int lst = 0;
	k = 1;
	l = 0;
	int cnt = 0;
	int po = 0;
	for(auto i : v){
		ans -= (i.F - lst);
		ans += i.S;
		c[k] += c[k-1] + i.S;
		if(i.F - l - c[k-1] + po >= 0)ans += i.F - l - c[k-1], l = i.F, po = c[k-1];
		k ++;
		lst = i.F;
		cnt = max(cnt, ans);
	}
	cout << cnt;
}

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