-
Notifications
You must be signed in to change notification settings - Fork 30
/
Copy pathcode_2.cpp
49 lines (45 loc) · 1.01 KB
/
code_2.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
//
// code_2.cpp
// Algorithm
//
// Created by Mohd Shoaib Rayeen on 23/11/18.
// Copyright © 2018 Shoaib Rayeen. All rights reserved.
//
#include <iostream>
#include <vector>
using namespace std;
void largestThree(vector <int> a) {
long n = a.size();
int first , second, third;
third = first = second = INT_MIN;
for (int i = 0; i < n ; i ++) {
if (a[i] > first) {
third = second;
second = first;
first = a[i];
}
else if (a[i] > second) {
third = second;
second = a[i];
}
else if (a[i] > third) {
third = a[i];
}
}
cout << "\nLargest Three Elements\t:\t" << first << " " << second << " " << third;
cout << endl;
}
int main() {
int n;
cout << "\nEnter Size\t:\t";
cin >> n;
vector<int> a(n);
cout << "\nEnter Elements\n";
for ( int i = 0; i < n; i++ ) {
cin >> a[i];
}
largestThree(a);
a.clear();
cout << endl;
return 0;
}