Submission #138186

#	Time	Username	Problem	Language	Result	Execution time	Memory
138186		vince	Holiday (IOI14_holiday)	C++14	23 / 100	21 ms	2676 KiB

holiday

#include <stdio.h>
#include <math.h>
#include <string.h>
#include <limits.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#include <string>
#include <unordered_map>
#include <map>
#include <queue>
#include <set>
#include <stack>

using namespace std;

#define fi first
#define se second
typedef pair<int,int> ii;

int n, s, d;
int A[100003];

long long solve0()
{
	long long sum = 0, res = 0;
	priority_queue<int, vector<int>, greater<int> > pq;
	for(int i = 0; i < n; i++)
	{
		pq.push(A[i]);
		sum += A[i];
		while(pq.size() > d)
		{
			// printf("%d %d\n", i, pq.top());
			sum -= pq.top();
			pq.pop();
		}
		res = max(res, sum);
		d--;
	}
	return res;
}

long long int findMaxAttraction(int N, int start, int D, int attraction[]) 
{
	n = N;
	s = start;
	d = D;
	for(int i = 0; i < n; i++)
	{
		A[i] = attraction[i];
	}
    return solve0();
}

Compilation message (stderr)

holiday.cpp: In function 'long long int solve0()':
holiday.cpp:34:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(pq.size() > d)
         ~~~~~~~~~~^~~

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