제출 #1248098

#제출 시각아이디문제언어결과실행 시간메모리
1248098nguthianmangcayK개의 묶음 (IZhO14_blocks)C++20
0 / 100
0 ms328 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();
}

컴파일 시 표준 에러 (stderr) 메시지

blocks.cpp: In function 'int main()':
blocks.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen("O(0).inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...