-
Notifications
You must be signed in to change notification settings - Fork 0
/
question_26.cpp
50 lines (41 loc) · 1.21 KB
/
question_26.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
/*
==> Find the smallest and second smallest element in an array <==
Question Link:- https://practice.geeksforgeeks.org/problems/find-the-smallest-and-second-smallest-element-in-an-array3226/1?page=2&difficulty[]=-1&category[]=Arrays&sortBy=submissions
Given an array of integers, your task is to find the smallest and second smallest
element in the array. If smallest and second smallest do not exist, print -1.
Example 1:
Input :
5
2 4 3 5 6
Output :
2 3
Explanation:
2 and 3 are respectively the smallest
and second smallest elements in the array.
Example 2:
Input :
6
1 2 1 3 6 7
Output :
1 2
Explanation:
1 and 2 are respectively the smallest
and second smallest elements in the array.
*/
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
vector<int> minAnd2ndMin(int a[], int n) {
sort(a, a+n);
set<int> s;
for ( int i = 0; i < n; i++ ) s.insert(a[i]);
if ( s.size() < 2 ) return { -1, -1 };
return { *s.begin(), *(++s.begin())};
}
int main () {
int a[] = {1, 2, 1, 3, 6, 7};
vector<int> ans = minAnd2ndMin(a, 6);
cout << ans[0] << " " << ans[1];
}