Submission #37191709

---

Source Code Expand

/*

⣿⣯⣿⣟⣟⡼⣿⡼⡿⣷⣿⣿⣿⠽⡟⢋⣿⣿⠘⣼⣷⡟⠻⡿⣷⡼⣝⡿⡾⣿
⣿⣿⣿⣿⢁⣵⡇⡟⠀⣿⣿⣿⠇⠀⡇⣴⣿⣿⣧⣿⣿⡇⠀⢣⣿⣷⣀⡏⢻⣿
⣿⣿⠿⣿⣿⣿⠷⠁⠀⠛⠛⠋⠀⠂⠹⠿⠿⠿⠿⠿⠉⠁⠀⠘⠛⠛⠛⠃⢸⣯
⣿⡇⠀⣄⣀⣀⣈⣁⠈⠉⠃⠀⠀⠀⠀⠀⠀⠀⠀⠠⠎⠈⠀⣀⣁⣀⣀⡠⠈⠉
⣿⣯⣽⡿⢟⡿⠿⠛⠛⠿⣶⣄⠀⠀⠀⠀⠀⠀⠈⢠⣴⣾⠛⠛⠿⠻⠛⠿⣷⣶
⣿⣿⣿⠀⠀⠀⣿⡿⣶⣿⣫⠉⠀⠀⠀⠀⠀⠀⠀⠈⠰⣿⠿⠾⣿⡇⠀⠀⢺⣿
⣿⣿⠻⡀⠀⠀⠙⠏⠒⡻⠃⠀⠀⠀⠀⣀⠀⠀⠀⠀⠀⠐⡓⢚⠟⠁⠀⠀⡾⢫
⣿⣿⠀⠀⡀⠀⠀⡈⣉⡀⡠⣐⣅⣽⣺⣿⣯⡡⣴⣴⣔⣠⣀⣀⡀⢀⡀⡀⠀⣸
⣿⣿⣷⣿⣟⣿⡿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⢻⢾⣷⣿
⣿⣿⣟⠫⡾⠟⠫⢾⠯⡻⢟⡽⢶⢿⣿⣿⡛⠕⠎⠻⠝⠪⢖⠝⠟⢫⠾⠜⢿⣿
⣿⣿⣿⠉⠀⠀⠀⠀⠈⠀⠀⠀⠀⣰⣋⣀⣈⣢⠀⠀⠀⠀⠀⠀⠀⠀⠀⣐⢸⣿
⣿⣿⣿⣆⠀⠀⠀⠀⠀⠀⠀⠀⢰⣿⣿⣿⣿⣿⣧⠀⠀⠀⠀⠀⠀⠀⠀⢀⣾⣿
⣿⣿⣿⣿⣦⡔⠀⠀⠀⠀⠀⠀⢻⣿⡿⣿⣿⢽⣿⠀⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿
⣿⣿⣿⣿⣿⣿⣶⣤⣀⠀⠀⠀⠘⠛⢅⣙⣙⠿⠉⠀⠀⠀⢀⣠⣴⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣶⣤⣄⣅⠀⠓⠀⠀⣀⣠⣴⣺⣿⣿⣿⣿⣿⣿⣿⣿

*/
#include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
#include <cmath>
#include <numeric>
 
using namespace std;
typedef long long int ll;
typedef long double ld;
#define N 200020
#define pi 3.141592653589793238462
#define r(n) ll n; cin >> n;
#define s(n) string n; cin >> n;
#define mp(i, j) make_pair(i, j)
#define pb(i) push_back(i)
#define pl pair<ll,ll>
#define f(i, s, e, inc) for(ll i = s; i < e; i+=inc) 
#define fd(i, s, e, dec) for(ll i = s; i >= e; i-=dec)
#define p(x) cout << x << '\n'
//#define MOD 1000000007
#define MOD 998244353 
#define tf(x) if(x) cout << "Yes" << '\n'; else cout << "No" << '\n';
#define L 20
/*  cout << fixed << setprecision(10);  */

void readArr(ll arr[], ll size)
{ for(ll i = 0; i < size; i++) cin >> arr[i]; }
 
void printArray(ll arr[], ll size)
{ for(ll i = 0; i < size; i++) { cout << arr[i] << " "; } cout << '\n'; }
 
void printVector(vector<ll>& v)
{ for(ll i = 0; i < v.size(); i++) cout << v[i] << " "; cout << '\n'; }
 
void printSet(set<ll>& s)
{ for(auto ptr = s.begin(); ptr!=s.end(); ptr++) cout << (*ptr) << " "; cout << '\n'; }
 
void printMap(map<ll,ll>& mp)
{ for(auto it: mp) cout << it.first << " " << it.second << '\n'; cout << '\n'; }

void solve()
{   
    ll n, m, k; cin >> n >> m >> k; 
    ll a[n]; readArr(a, n);  multiset<pl> ms;
    multiset<pl> current;
    vector<bool> used(n, false);
    f(i, 0, m, 1){
        ms.insert(mp(a[i], i));
    }
    ll sum = 0; ll need = k;
    while(need--){
        pl curr = *ms.begin();
        ms.erase(ms.begin());
        sum+=curr.first;
        used[curr.second] = true;
        current.insert(curr);
    }
    ll prevIdx = 0; cout << sum << " ";
    f(i, m, n, 1){
        ms.insert(mp(a[i], i));
        while(ms.size()>0 && (*ms.begin()).second<=prevIdx) {ms.erase(ms.begin());}
        //for(auto it: ms) cout << it.first << " " << it.second << " ";
        //cout << '\n';
        if(used[prevIdx]){
            current.erase(current.find(mp(a[prevIdx], prevIdx)));
            pl nextBest = *ms.begin();
            ms.erase(ms.begin());
            current.insert(nextBest);
            sum-=a[prevIdx]; sum+=nextBest.first;
            used[prevIdx] = false; used[nextBest.second] = true;
        }
        else{
            ll bigboi = (*current.rbegin()).first;
            ll smallboi = (*ms.begin()).first;
            if(smallboi < bigboi){
                pl bigpair = *current.rbegin();
                pl smallpair = *ms.begin();
                used[bigpair.second] = false;
                used[smallpair.second] = true;
                sum-=bigboi; sum+=smallboi;
                current.erase(current.find(bigpair));
                ms.insert(bigpair);
                current.insert(smallpair);
                ms.erase(ms.find(smallpair));
            }
        }
        prevIdx++;
        cout << sum << " ";
    }
    cout << '\n';

} 

int main()
{
  //ios::sync_with_stdio(false);
      //cin.tie(NULL);
          ll sus = 1;
              //cin >> sus;
                 f(i, 0, sus, 1) 
                            solve();
}

Submission Info

Compile Error

./Main.cpp: In function ‘void printVector(std::vector<long long int>&)’:
./Main.cpp:52:19: warning: comparison of integer expressions of different signedness: ‘ll’ {aka ‘long long int’} and ‘std::vector<long long int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   52 | { for(ll i = 0; i < v.size(); i++) cout << v[i] << " "; cout << '\n'; }
      |                 ~~^~~~~~~~~~

Judge Result