Submission #31196561

---

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<cstring>
using namespace std;

int n, m;
int arr[200010][2];
long long v[200010];
multiset<int> ms;
priority_queue<int> pq;

int main()
{
	int i;
	long long ans;
	long long x;
	long long sum;
	int cnt;

	cin >> n >> m;
	for (i = 1; i <= n; i++)
	{
		cin >> arr[i][0] >> arr[i][1];
	}

	ans = 0;
	for (i = 1; i <= n; i++)
	{
		if (arr[i][0] == 1) ans = arr[i][1];
		else ans += arr[i][1];

		v[i] = ans;
	}

	x = ans;
	cnt = 0;
	sum = 0;
	for (i = n; i >= 1; i--)
	{
		if (arr[i][0] == 1)
		{
			if (cnt < m)
			{
				x = v[i - 1] + sum;
				cnt++;
			}
			else
			{
				if (pq.empty()) break;

				sum += pq.top();
				pq.pop();
				x = v[i - 1] + sum;
			}
		}
		else
		{
			sum += arr[i][1];

			if (arr[i][1] >= 0) continue;

			if (cnt < m)
			{
				pq.push(arr[i][1]);
				x -= arr[i][1];
				sum -= arr[i][1];
				cnt++;
			}
			else
			{
				if (!pq.empty() && pq.top() > arr[i][1])
				{
					x += pq.top();
					sum += pq.top();
					pq.pop();
					x -= arr[i][1];
					sum -= arr[i][1];
					pq.push(arr[i][1]);
				}
			}
		}

		ans = max(ans, x);
	}

	cout << ans;
}

Submission Info

Judge Result