Submission #945731

#TimeUsernameProblemLanguageResultExecution timeMemory
945731beepbeepsheepRoad Construction (JOI21_road_construction)C++17
5 / 100
55 ms7104 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define ii pair<ll,ll> #define iii tuple<ll,ll,ll> #ifndef DEBUG #define cerr if (0) cerr #define endl '\n' #endif // DEBUG const ll maxn=1005; const ll inf=1e15; const ll mod=1e9+7; ll x[maxn],y[maxn]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); ll n,k; cin>>n>>k; for (int i=1;i<=n;i++){ cin>>x[i]>>y[i]; } vector<ll> v; for (int i=1;i<=n;i++){ for (int j=i+1;j<=n;j++){ v.emplace_back(abs(x[i]-x[j])+abs(y[i]-y[j])); } } sort(v.begin(),v.end()); for (int i=1;i<=k;i++){ cout<<v[i-1]<<endl; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...