# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1248098 | nguthianmangcay | K blocks (IZhO14_blocks) | C++20 | 0 ms | 328 KiB |
#include<bits/stdc++.h>
using namespace std;
const int K=105;
const int N=1e5+3;
#define ll long long
#define fi first
#define se second
#define pi pair
int a[N];
ll dp[K];
void jiangly()
{
int n,k;
cin>>n>>k;
int ma=0;
priority_queue<int,vector<int>,greater<int>>q;
for(int i=1;i<=n;i++)
{
cin>>a[i];
ma=max(ma,a[i]);
q.push(a[i]);
}
dp[1]=ma;
for(int i=2;i<=k;i++)
{
dp[i]=dp[i-1]+q.top();
q.pop();
}
cout<<dp[k];
}
int main()
{
cin.tie(0)->sync_with_stdio(0);
if(fopen("QUANSENSEI.inp","r"))
{
freopen("O(0).inp","r",stdin);
}
jiangly();
}
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... |