제출 #1160037

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1160037		mariaclara	Road Construction (JOI21_road_construction)	C++20	0 / 100	3064 ms	2104412 KiB

road_construction

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first 
#define sc second 

int n, k;
int main() {

    cin >> n >> k;

    vector<int> dist, x(n), y(n);

    for(int i = 0; i < n; i++) {
        cin >> x[i] >> y[i];

        for(int j = 0; j < i; j++)
            dist.pb(abs(x[i] - x[j]) + abs(y[i] - y[j]));
    }

    sort(all(dist));

    for(int i = 0; i < k; i++)
        cout << dist[i] << "\n";
}

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