# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
447901 | blue | Road Construction (JOI21_road_construction) | C++17 | 2323 ms | 2097156 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <algorithm>
using namespace std;
long long abs_diff(long long a, long long b)
{
return max(a-b, b-a);
}
int main()
{
int N, K;
cin >> N >> K;
long long X[N], Y[N];
for(int i = 0; i < N; i++) cin >> X[i] >> Y[i];
vector<long long> res;
for(int i = 0; i < N; i++)
for(int j = i+1; j < N; j++)
res.push_back(abs_diff(X[i], X[j]) + abs_diff(Y[i], Y[j]));
sort(res.begin(), res.end());
while(res.size() > K) res.pop_back();
for(long long r:res) cout << r << ' ';
cout << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |