-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCandyPiles.cpp
More file actions
56 lines (51 loc) · 1.09 KB
/
CandyPiles.cpp
File metadata and controls
56 lines (51 loc) · 1.09 KB
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
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
int main(){
int n,small = INT_MAX,count = 0;
cin >> n; // no of piles
vector<int> c(n);
for(int c_i = 0; c_i < n; c_i++){
cin >> c[c_i]; // candies in piles
}
for(int c_i = 0; c_i < n; c_i++){
small = min(small,c[c_i]); // candies in piles
}
for(int c_i = 0; c_i < n; c_i++){
if(small == c[c_i]){
count++;
}
}
if(count == 1){
int j = small;
small = small*2;
for(int c_i = 0; c_i < n; c_i++){
if(j != c[c_i])
small = min(small,c[c_i]); // candies in piles
}
cout<<small<<" "<<1;
}else{
cout<<small<<" "<<n;
}
return 0;
}