Submission #819227

#	Time	Username	Problem	Language	Result	Execution time	Memory
819227		cig32	Akcija (COCI21_akcija)	C++17	10 / 110	5 ms	468 KiB

Main

#include "bits/stdc++.h"
using namespace std;
#define int long long 
#define double long double
const int MAXN = 1e5 + 10;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
bool cmp(pair<int, int> x, pair<int, int> y) {
  return x.second < y.second;
}
void solve(int tc) {
  int n, k;
  cin >> n >> k;
  pair<int, int> p[n+1];
  for(int i=1; i<=n; i++) cin >> p[i].first >> p[i].second;
  sort(p+1, p+1+n, cmp);
  priority_queue<int, vector<int>, greater<int> > pq[n+1];
  pq[0].push(0);
  for(int i=1; i<=n; i++) {
    vector<pair<int, int> >found;
    for(int j=p[i].second-1; j>=0; j--) {
      while(found.size() < k && pq[j].size()) {
        found.push_back({j+1, pq[j].top() + p[i].first});
        found.push_back({j, pq[j].top()});
        pq[j].pop();
      }
    }
    for(pair<int, int> x: found) pq[x.first].push(x.second);
  }
  int cnt = 0;
  for(int i=n; i>=0; i--) {
    while(cnt < k && pq[i].size()) {
      cout << i << ' ' << pq[i].top() << "\n";
      cnt++;
      pq[i].pop();
    }
  }
}
int32_t main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
// 勿忘初衷

Compilation message (stderr)

Main.cpp: In function 'void solve(long long int)':
Main.cpp:38:26: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   38 |       while(found.size() < k && pq[j].size()) {
      |             ~~~~~~~~~~~~~^~~

• Subtask 1: 10 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 30
• Subtask 6: 0 / 20