Submission #24,249

2026-02-07 12:26:07

cpp17

Accepted 75/75

2ms

532 KiB

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    int n, k; cin >> n >> k;
    vector<int> v(n);
    for(int i = 0; i < n; i++) cin >> v[i];
    sort(v.begin(), v.end()); 
    ll ossz = 0;
    for(int i = 0; i < n; i++){
        for(int j = max(i + 1, n - k); j < n; j++){
            v[j] += v[i];
        }
        ossz += v[i];
    }
    cout << ossz;
}

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	1ms	512 KiB
		2	Accepted	0/0	1ms	316 KiB
		3	Accepted	1/1	1ms	316 KiB
		4	Accepted	1/1	1ms	336 KiB
		5	Accepted	1/1	1ms	316 KiB
		6	Accepted	1/1	1ms	316 KiB
		7	Accepted	1/1	1ms	508 KiB
		8	Accepted	1/1	1ms	316 KiB
		9	Accepted	1/1	1ms	316 KiB
		10	Accepted	1/1	1ms	316 KiB
		11	Accepted	2/2	1ms	500 KiB
		12	Accepted	5/5	1ms	316 KiB
		13	Accepted	5/5	1ms	532 KiB
		14	Accepted	5/5	1ms	324 KiB
		15	Accepted	5/5	1ms	316 KiB
		16	Accepted	5/5	1ms	356 KiB
		17	Accepted	5/5	2ms	332 KiB
		18	Accepted	5/5	2ms	316 KiB
		19	Accepted	5/5	1ms	316 KiB
		20	Accepted	5/5	1ms	316 KiB
		21	Accepted	5/5	1ms	508 KiB
		22	Accepted	5/5	1ms	316 KiB
		23	Accepted	5/5	1ms	316 KiB
		24	Accepted	5/5	1ms	316 KiB