Submission #586565

#	Time	Username	Problem	Language	Result	Execution time	Memory
586565		SeDunion	Holiday (IOI14_holiday)	C++17	0 / 100	23 ms	1196 KiB

holiday

#include"holiday.h"
#include<algorithm>
#include<iostream>
#include<vector>

using namespace std;
using ll = long long;

int cnt[111];

ll findMaxAttraction(int n, int start, int d, int attraction[]) {
	ll ans = 0;
	for (int i = 0 ; i < n ; ++ i) {
		cnt[attraction[i]]++;
	}
	for (int i = 0 ; i < n ; ++ i) {
		int x = d - i;
		ll cur = 0;
		for (int y = 100 ; y >= 0 ; -- y) {
			int q = min(cnt[y], x);
			x -= q;
			cur += q * y;
		}
		ans = max(ans, cur);
	}

	return ans;
}

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