# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1163617 | salmon | Akcija (COCI21_akcija) | C++20 | 56 ms | 1092 KiB |
#include <bits/stdc++.h>
using namespace std;
int N;
int K;
vector<long long int> memo[2100];
vector<int> v;
const long long int inf = 1.1e18;
vector<int> W[2100];
int num = 0;
int main(){
scanf(" %d",&N);
scanf(" %d",&K);
for(int i = 0; i < N; i++){
int w;
int d;
scanf(" %d",&w);
scanf(" %d",&d);
W[d].push_back(w);
}
for(int j = 0; j <= N; j++){
memo[j].push_back(inf);
}
memo[0][0] = 0;
for(int i = 0; i <= N; i++){
for(int l : W[i]){
for(int j = i; j >= 1; j--){
vector<long long int> v = memo[j - 1];
vector<long long int> v1 = memo[j];
for(int i = 0; i < v.size(); i++){
v[i] += l;
}
memo[j].clear();
merge(v.begin(),v.end(),v1.begin(),v1.end(),back_inserter(memo[j]));
while(memo[j].size() > K) memo[j].pop_back();
}
}
}
printf("s");
int cont = 0;
for(int i = N; i >= 0; i--){
for(int j = 0; j <= memo[i].size(); j++){
if(memo[i][j] >= inf) continue;
printf("%d %lld\n",i,memo[i][j]);
cont++;
if(cont == K) break;
}
if(cont == K) break;
}
}
컴파일 시 표준 에러 (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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |