1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#include <iostream>
#include <cmath>
#include <limits>

using namespace std;

int main() {
    int n;
    unsigned long long m;
    long long *A;
    long long **Ab;
    
    cin>>n>>m;
    
    A = new long long [n];
    Ab = new long long *[n];
    
    for(int i = 0; i < n; i++){
        cin>>A[i];
        Ab[i] = new long long [m+1]{0};
    }     
    
    for(int i = 1; i < n; i++){
        Ab[i][0] = numeric_limits<int>::min();
    }
    
    for(unsigned long long j = 1; j < m+1; j++){
        Ab[0][j] = max(A[0]*__builtin_popcount(j), Ab[0][j-1]);
    }
    
    for(int i = 1; i < n; i++){
        for(unsigned long long j = 1; j < m+1; j++){
            Ab[i][j] = max(A[i]*__builtin_popcount(j) + Ab[i-1][j-1], Ab[i][j-1]);
        }
    }
    
    cout<<Ab[n-1][m];
    
    for(int i = 0; i < n; i++){
        delete [] Ab[i];
    }
    
    delete [] Ab;
    
    delete [] A;
    
	return 0;
}