https://oj.luyencode.net/problem/ELEVATOR

[utterances-bot]

Thang máy - Luyện Code Online

https://luyencode.net/problem/ELEVATOR

[vmtuan12]

cho em hỏi test 20 với ạ

[sseu18042004]

Gợi ý là sort lại theo chiều tăng dần, rồi lấy cái cuối trừ 1 nhân 2 trừ index đi k rồi cứ làm rứa :))

lì cutie & ớt cutie <3

#include #define ll long long int #define ull unsigned long long int #define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); #define el cout<<"\n" using namespace std; int main() { fast int n,k; cin>>n>>k; vector v; for (int i=0;i>x; v.push_back(x); } sort (v.begin(),v.end()); int x=v.size()%k; x--; ll res=0; if (x>-1) { res+=(v[x]-1)*2; } x+=k; while(x

[hieuvanloc03]

include

include

include

using namespace std;

void heapify(vector& a, int n, int i) { int l = 2 i + 1; int r = 2 i + 2; int largest = i; if (l<n && a[l]>a[largest]) { largest = l; } if (r<n && a[r]>a[largest]) { largest = r; } if (largest != i) { swap(a[largest], a[i]); heapify(a, n, largest); } }

void headsort(vector& a, int n) { for (int i = n / 2 - 1; i >= 0; i--) { heapify(a, n, i); } for (int i = n - 1; i >= 0; i--) { swap(a[i], a[0]); heapify(a, i, 0); } }

int main() { int n, f; cin >> n >> f; vector a; for (int i = 0; i < n; i++) { int k; cin >> k; a.push_back(k); } headsort(a, n); int S = 0; int cuoi=0;
for (int i = 0; i < n; i++) { S += ((a.back() - 1) 2);
a.erase(a.end() - f , a.end());
cuoi = S; if(a.size()<=f){ cuoi += ((a.back() - 1) 2); break; } } cout << cuoi; return 0; }