Submission #936624

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
936624	2024-03-02T12:14:39 Z	william950615	Self Study (JOI22_ho_t2)	C++14	10 / 100	49 ms	11536 KB

Main

#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();

}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	612 KB	Output is correct
11	Correct	48 ms	10908 KB	Output is correct
12	Correct	46 ms	10836 KB	Output is correct
13	Correct	36 ms	8788 KB	Output is correct
14	Correct	37 ms	8732 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	24 ms	6304 KB	Output is correct
17	Correct	49 ms	11536 KB	Output is correct
18	Correct	48 ms	10756 KB	Output is correct

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	24 ms	6304 KB	Output is correct
3	Correct	49 ms	11536 KB	Output is correct
4	Correct	48 ms	10756 KB	Output is correct
5	Incorrect	0 ms	348 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	612 KB	Output is correct
11	Correct	48 ms	10908 KB	Output is correct
12	Correct	46 ms	10836 KB	Output is correct
13	Correct	36 ms	8788 KB	Output is correct
14	Correct	37 ms	8732 KB	Output is correct
15	Incorrect	0 ms	348 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	348 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	612 KB	Output is correct
11	Correct	48 ms	10908 KB	Output is correct
12	Correct	46 ms	10836 KB	Output is correct
13	Correct	36 ms	8788 KB	Output is correct
14	Correct	37 ms	8732 KB	Output is correct
15	Incorrect	0 ms	348 KB	Output isn't correct
16	Halted	0 ms	0 KB	-