Submission #936624

#TimeUsernameProblemLanguageResultExecution timeMemory
936624william950615Self Study (JOI22_ho_t2)C++14
10 / 100
49 ms11536 KiB
#include<bits/stdc++.h> using namespace std; #define F first #define S second #define mkp make_pair #define PH push #define PB push_back #define REP(i,N) for( int i = 0; i < (N); ++i ) #define FOR(i,a,b) for( int i = (a); i <= (b); ++i ) #define ALL(x) begin(x), end(x) #define MEM(x) memset(x, 0, sizeof(x)) typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; template<typename T> using V=vector<T>; void solve() { int N, M; cin >> N >> M; V<pll> vc(N); ll mn=1e18; for( auto &i : vc ) cin >> i.F; for( auto &i : vc ) cin >> i.S, i.S = max( i.F, i.S ), mn = min( mn, i.S ); cout << mn << '\n'; } int main() { int T = 1; #ifdef LOCAL freopen( "input.txt", "r", stdin); freopen( "output.txt", "w", stdout ); cin >> T; #else ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); #endif while(T--) solve(); }
#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...