26 lines
626 B
C++
26 lines
626 B
C++
// lanqiao3515 整数删除(模拟法)
|
|
#include<bits/stdc++.h>
|
|
using namespace std;
|
|
int main(){
|
|
int n, k; cin >> n >> k;
|
|
vector<int> vc;
|
|
for(int i = 0; i < n; i++){
|
|
int x; cin >> x;
|
|
vc.push_back(x);
|
|
}
|
|
while(k--){
|
|
int minId = 0;
|
|
for(int i = 1; i < vc.size(); i++){
|
|
if(vc[i] < vc[minId]) minId = i;
|
|
}
|
|
if(minId - 1 >= 0) vc[minId - 1] += vc[minId];
|
|
if(minId + 1 < vc.size()) vc[minId + 1] += vc[minId];
|
|
vc.erase(vc.begin() + minId);
|
|
}
|
|
for(auto i:vc) cout << i << ' ';
|
|
return 0;
|
|
}
|
|
/* test samples -> 17 7
|
|
5 3
|
|
1 4 2 8 7
|
|
*/ |