#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { vector<int> A = {13 , 2 ,3, 11}; sort(A.begin(),A.end()); bool present = binary_search(A.begin(),A.end(),20); for(int i=0; i<4; i++){ cout<<A[i]<<" "; } cout<<endl; cout<<present; cout<<endl; cout<<*A.begin(); }