제출 #906956

#제출 시각아이디문제언어결과실행 시간메모리
906956ibm2006Road Construction (JOI21_road_construction)C++17
5 / 100
1750 ms2097156 KiB
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n,i,j,k,l,r,x,y,z,w,s,t;
pair<ll,ll> p[1100000];
vector<ll> v;
int main()
{
    scanf("%lld %lld",&n,&k);
    for(i=1;i<=n;i++)
    {
        scanf("%lld %lld",&x,&y);
        p[i]={x,y};
    }
    for(i=1;i<=n;i++)
    {
        for(j=1;j<i;j++)
        {
            v.push_back(max(p[i].first-p[j].first,p[j].first-p[i].first)+max(p[i].second-p[j].second,p[j].second-p[i].second));
        }
    }
    sort(v.begin(),v.end());
    for(i=0;i<k;i++)
    {
        printf("%lld\n",v[i]);
    }
}

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

road_construction.cpp: In function 'int main()':
road_construction.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     scanf("%lld %lld",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
road_construction.cpp:12:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |         scanf("%lld %lld",&x,&y);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~
#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...