# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
443846 | NintsiChkhaidze | K blocks (IZhO14_blocks) | C++14 | 1 ms | 332 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define pb push_back
#define s second
#define f first
#define ll long long
#define int ll
using namespace std;
const int N = 100005;
int dp[105][N],a[N];
main (){
ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
int n,k;
cin>>n>>k;
for (int i = 1; i <= n; i++)
cin>>a[i];
sort(a + 1, a + n + 1);
for (int i = 1; i <= k; i++)
for (int j = 0; j <= n; j++)
dp[j][i] = 1e9;
dp[0][0] = 0;
for (int i = 1; i <= n; i++){
for (int j = 1; j <= k; j++){
for (int id = i; id >= 1; id--){
dp[i][j] = min(dp[i][j],dp[id - 1][j - 1] + a[i]);
}
}
}
cout<<dp[n][k];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |