-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathLargest element of an Array using STL.cpp
64 lines (47 loc) · 1.18 KB
/
Largest element of an Array using STL.cpp
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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
///Largest element of an Array using STL
/**
*
* author :: 101rror
*
**/
#include <bits/stdc++.h>
using namespace std;
#define MAX 100
#define infinity 1000000000000000LL
#define all(x) (x).begin(),(x).end()
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define mod(x,m) ((x%m)+m)%m; //101rror
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL))
#define T while(t--)
#define for2(i,a,b) for(i=a;i>=b;i--)
#define for3(i,a,b) for(i=a;i<=b;i=i+2)
#define for1(i,a,b) for(i=a;i<=b;i=i+1)
#define for4(i,a,b) for(i=a;i>=b;i=i-2)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) 42
#endif
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
fastread();
int i, num;
cin >> num;
int array[num];
for(i = 0; i < num; i++)
{
cin >> array[i];
}
sort(array, array + num);
int Largest = *max_element(array, array + num);
cout << endl;
cout << "The Largest Element is : " << Largest;
cout << endl;
return 0;
}