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;
#define int long long
int n;int K;
pair<int,int>ar[200005];
pair<int,int>br[200005];
signed main(){
cin>>n>>K;
int x=-1e12;int y=-1e12;
for(int i=1;i<=n;i++){
cin>>ar[i].first>>ar[i].second>>br[i].first>>br[i].second;
x=max(x,ar[i].first);
y=max(y,ar[i].second);
}
cout<<x<<" "<<y<<endl;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |