Submission #793523

#	Time	Username	Problem	Language	Result	Execution time	Memory
793523		fuad27	Road Construction (JOI21_road_construction)	C++17	5 / 100	5323 ms	2097152 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, vector<unsigned int>, greater<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(k--) {
    cout << pq.top() << "\n";
    pq.pop();
  }
}
int main () {
  cin.tie(0)->sync_with_stdio(0);
  int t=1;
  while(t--)solve();
  return 0;
}

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