# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
744135 | salmon | Izvanzemaljci (COI21_izvanzemaljci) | C++14 | 0 ms | 0 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 <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> v;
vector<pair<int,int>> o;
int N,K;
int a,b;
int st[400100];
int main(){
scanf(" %d",&N);
scanf(" %d",&K);
int smalla,smallb;
int biga,bigb;
for(int i = 0; i < N; i++){
v.push_back(make_pair(a,b));
o.push_back(make_pair(b,a));
}
sort(v.begin(),v.end());
sort(o.begin(),o.end())
int l = max(1,max(v[v.size() - 1].first - v[0].first, o[o.size() - 1].first - o[0].second));
printf("%d %d %d",smalla,smallb,l);
}