제출 #1275887

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1275887		Leyna	휴가 (IOI14_holiday)	C++20	23 / 100	14 ms	824 KiB

holiday

#include"holiday.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
    ll result = 0;
    vector<int> sorted_attractions(100, 0);
    for (int i=0; i<n; i++){
        sorted_attractions[attraction[i]]++;
        ll val = 0;
        int available = d-i;
        for (int j=100; j>0 && available > 0; j--){
            val += min(available, sorted_attractions[j]) * j;
            available -= sorted_attractions[j];
        }
        result = max(result, val);
    }
    return result;
}

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