제출 #793528

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
793528		fuad27	Road Construction (JOI21_road_construction)	C++17	5 / 100	10048 ms	5192 KiB

road_construction

#include<bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
void solve() {
  int n, k;
  cin >> n >> k;
  int x[n], y[n];
  priority_queue<unsigned int> pq;
  for(int i = 0;i<n;i++) {
    cin >> x[i] >> y[i];

  }
  for(int i = 0;i<n;i++)
    for(int j = i+1;j<n;j++){
      pq.push((unsigned int)abs(x[i]-x[j])+abs(y[i]-y[j]));
      while(pq.size()>k) {
        pq.pop();
      }
    }
  vector<unsigned int> v;
  while(pq.size()){
    v.push_back(pq.top());
    pq.pop();
  }
  for(int i=v.size()-1;i>=0;i--)cout << v[i] << "\n";
}
int main () {
  cin.tie(0)->sync_with_stdio(0);
  int t=1;
  while(t--)solve();
  return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

road_construction.cpp: In function 'void solve()':
road_construction.cpp:17:22: warning: comparison of integer expressions of different signedness: 'std::priority_queue<unsigned int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   17 |       while(pq.size()>k) {
      |             ~~~~~~~~~^~

• Subtask 1: 5 / 5
• Subtask 2: 0 / 6
• Subtask 3: 0 / 7
• Subtask 4: 0 / 20
• Subtask 5: 0 / 27
• Subtask 6: 0 / 35