제출 #1340014

#제출 시각아이디문제언어결과실행 시간메모리
1340014caveeeeTezina (COCI26_tezina)C++20
17 / 70
2090 ms1092 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);

    int N, k; cin >> N >> k;
    vector<long long>v (N);

    for(int i = 0; i<N; i++){
        cin >> v[i];
    }

    sort(v.rbegin(), v.rend());

    long long ans = 0;

    for(int i = 1; i<=k; i++){
        long long sum = 0;

        for(int j = 0; j<N; j++){
            if(i > v[j]){
                break;
            }

            long long a = v[j]/i;
            long long b = min(a*(v[j] + 2), (long long)1e8);
        
            //cout << b << " ";
            sum += b;
        }

        ans += sum;
        //cout << sum << '\n';
    }
    
    cout << ans << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...