이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
typedef long long ll;
using namespace std;
int n,k;
void solve()
{
cin >> n >> k;
ll mnx = 1e9+7;
ll mxx = 0;
ll mny = 1e9+7;
ll mxy = 0;
for(int i=0;i<n;i++)
{
ll x,y;
cin >> x >> y;
mnx = min(mnx,x);
mxx = max(mxx,x);
mny = min(mny,y);
mxy = max(mxy,y);
}
ll tmp = max(mxx-mnx,mxy-mny);
cout << mnx << " " << mny << " " << tmp << endl;
return;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int tc=1;
//cin>>tc;
for(int i=1;i<=tc;i++) solve();
return 0;
}
# | 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... |