제출 #1130345

#제출 시각아이디문제언어결과실행 시간메모리
1130345am_aadvikFireworks (APIO16_fireworks)C++17
0 / 100
0 ms324 KiB
#include <iostream>
#include<vector>
#include<string>
#include<queue>
#include<map>
#include<set>
#include<algorithm>
#include<math.h>
#define int long long
const int debug = 0;
const int inf = 1e17;
const int maxn = 300005;
const int mod = (int)1e9 + 7;
using namespace std;

int32_t main()
{
	int n, m; cin >> n >> m;
	vector<int> a(n);
	for (int i = 1; i < (n + m); ++i) {
		int x, y; cin >> x >> y;
		a.push_back(y);
	}

	sort(a.begin(), a.end());
	cout << a[a.size() / 2];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...