Submission #208258

#TimeUsernameProblemLanguageResultExecution timeMemory
208258SortingHoliday (IOI14_holiday)C++14
23 / 100
34 ms1272 KiB
#include"holiday.h"
#include <bits/stdc++.h>

using namespace std;

const int kMax = 107;

int cnt[kMax];

long long findMaxAttraction(int n, int start, int d, int attraction[]){
    long long ans = 0;
    for(int dist = 0; dist < min(n, d); ++dist){
    	int rem = d - dist;
    	long long curr_ans = 0;

    	++cnt[attraction[dist]];

    	for(int i = kMax - 1; i >= 0; --i){
    		if(cnt[i] <= rem){
    			rem -= cnt[i];
    			curr_ans += i * cnt[i];
    		}
    		else{
    			curr_ans += i * rem;
    			break;
    		}
    	}

    	ans = max(ans, curr_ans);
    }

    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...