Submission #398077

#	Time	Username	Problem	Language	Result	Execution time	Memory
398077		prvocislo	Holiday (IOI14_holiday)	C++17	23 / 100	41 ms	5360 KiB

holiday

#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
typedef long long ll;
using namespace std;

void upd(ll& a, const ll& b) { a = max(a, b); }
multiset<int> best;
ll sum = 0;
void erase(int x)
{
	best.erase(best.find(x)); sum -= x;
}
void insert(int x)
{
	best.insert(x); sum += x;
}
ll findMaxAttraction(int n, int s, int d, int a[])
{
	ll ans = 0;
	for (int r = 0; r < n; r++)
	{
		int siz = d - r;
		if (siz < 0) break;
		insert(a[r]);
		while (best.size() > siz) erase(*best.begin());
		ans = max(ans, sum);
	}
	return ans;
}

Compilation message (stderr)

holiday.cpp: In function 'll findMaxAttraction(int, int, int, int*)':
holiday.cpp:27:22: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   27 |   while (best.size() > siz) erase(*best.begin());
      |          ~~~~~~~~~~~~^~~~~

• Subtask 1: 0 / 7
• Subtask 2: 23 / 23
• Subtask 3: 0 / 17
• Subtask 4: 0 / 53