CompetitiveProgramming_or_DSA_CPP/35_upper_bound_02.cpp at main · naymur92/CompetitiveProgramming_or_DSA_CPP · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
#include <bits/stdc++.h>
using namespace std;

int main(){
	int n;
	cin >> n;
	set<int> s;

	for (int i = 0; i < n; ++i)
	{
		int x;
		cin >> x;
		s.insert(x);
	}

	// for(auto &val: s) cout << val << " ";
	// cout << endl;

	// for (int i = 0; i < 1e5; ++i)
	// {
	// 	// auto it = lower_bound(s.begin(), s.end(), rand());
	// 	auto it = s.lower_bound(rand());
	// }

	auto it = s.upper_bound(5);
	if(it == s.end())
	{
		cout << "Not Found!" << endl;
		return 0;
	}
	cout << *it << endl;
}

/*
6
4 5 2 25 7 8
*/