Language: C++

#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}

//INSERT ABOVE HERE
signed main(){
  Int n,k;
  cin>>n>>k;
  vector<Int> c(n),v(n);
  for(Int i=0;i<n;i++) cin>>c[i]>>v[i],c[i]--;

  vector<vector<Int> > G(k);
  for(Int i=0;i<n;i++) G[c[i]].emplace_back(v[i]);

  {
    Int flg=1;
    vector<Int> vs(k);
    for(Int i=0;i<k;i++){
      flg&=G[i].size()==2u;
      for(Int x:G[i]) vs[i]+=x;
    }
    if(flg){
      sort(vs.rbegin(),vs.rend());
      for(Int i=1,j=0,s=0;i<=n;i++){
        if(i&1){
          cout<<-1<<"\n";
          continue;
        }
        s+=vs[j++];
        cout<<s<<"\n";
      }
      cout<<flush;
      return 0;
    }
  }
  // bagutteruno kokokara
  
  vector<Int> ans(n+1,-1);
  struct T{
    Int w,v,c;
    T(Int w,Int v,Int c):w(w),v(v),c(c){}
    bool operator<(const T &a)const{
      //return v/w > a.v/a.w;
      if(v*a.w==a.v*w) return w>a.w;
      return v*a.w > a.v*w;
    }
  };
  using P = pair<Int, Int>;
  vector<priority_queue<P> > pq(k);
  priority_queue<P> bs;
  priority_queue<P> ts;
  priority_queue<P, vector<P>, greater<P> > tt;
  vector<T> vt;
  
  for(Int i=0;i<k;i++){
    sort(G[i].rbegin(),G[i].rend());
    vt.emplace_back(2,G[i][0]+G[i][1],i);
    if(G[i].size()>2u){
      ts.emplace(G[i][0]+G[i][1]+G[i][2],i);
    }    
    for(Int j=2;j<(Int)G[i].size();j++){
      vt.emplace_back(1,G[i][j],i);
      pq[i].emplace(G[i][j],(i<<30)|j);
    }
  }
  sort(vt.begin(),vt.end());
  
  Int l=0,s=0,p1=1e17;
  set<P> used;
  set<Int> used2,used3;
  vector<Int> cnt(k,0);
  for(T t:vt){
    // cout<<l<<" "<<s<<":"<<t.w<<" "<<t.v<<" "<<t.c<<endl;
    l+=t.w;
    s+=t.v;
    while(!bs.empty()){
      if(used.count(bs.top())){
        Int c=bs.top().second>>30;
        bs.pop();
      }
      else break;
    }
    used2.emplace(t.c);
    while(!ts.empty()){
      if(used2.count(ts.top().second)) ts.pop();
      else break;
    }
    while(!tt.empty()){
      if(used3.count(tt.top().second)) tt.pop();
      else break;
    }
    if(t.w==2){
      // remove 1
      chmax(ans[l-1],s-p1);
      
      //remove cur, put 1
      if(!bs.empty()){
        chmax(ans[l-1],s-t.v+bs.top().first);
      }
      if(!tt.empty()){
        Int p2=tt.top().first;

        //remove cur and 2, put 3
        if(!ts.empty()){
          chmax(ans[l-1],s-t.v-p2+ts.top().first);
        }
        //remove 2, put nxt
        if(!pq[t.c].empty()){        
          chmax(ans[l-1],s-p2+pq[t.c].top().first);
          bs.emplace(pq[t.c].top());
        }
      }
      tt.emplace(t.v,t.c);
    }else{
      chmin(p1,t.v);

      used.emplace(pq[t.c].top());pq[t.c].pop()
      if(!pq[t.c].empty()) bs.emplace(pq[t.c].top());
      
      used3.emplace(t.c);
    }
    chmax(ans[l],s);
  }  
  for(Int i=1;i<=n;i++) cout<<ans[i]<<"\n";
  cout<<flush;
  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:119:48: error: expected ';' before 'if'
  119 |       used.emplace(pq[t.c].top());pq[t.c].pop()
      |                                                ^
      |                                                ;
  120 |       if(!pq[t.c].empty()) bs.emplace(pq[t.c].top());
      |       ~~