Repository navigation
Expand file tree
/
Copy pathMiniMaxSum.cpp
More file actions
87 lines (63 loc) · 1.57 KB
/
Copy pathMiniMaxSum.cpp
File metadata and controls
87 lines (63 loc) · 1.57 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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
#include <numeric>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
vector<string> split(const string &);
/*
* The function accepts INTEGER_ARRAY arr as parameter.
*/
void miniMaxSum(vector<int> arr) {
sort(arr.begin(), arr.end());
long long min = 0LL, max = 0LL;
for(int i = 0; i < 4; i++) {
min = min + arr[i];
}
for(int i = 1; i < 5; i++) {
max = max + arr[i];
}
cout << min << " " << max << endl;
}
int main()
{
string arr_temp_temp;
getline(cin, arr_temp_temp);
vector<string> arr_temp = split(rtrim(arr_temp_temp));
vector<int> arr(5);
for (int i = 0; i < 5; i++) {
int arr_item = stoi(arr_temp[i]);
arr[i] = arr_item;
}
miniMaxSum(arr);
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), [](unsigned char c) { return !ispunct(c); })
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), [](unsigned char c) { return !ispunct(c); }).base(),
s.end()
);
return s;
}
vector<string> split(const string &str) {
vector<string> tokens;
string::size_type start = 0;
string::size_type end = 0;
while ((end = str.find(" ", start)) != string::npos) {
tokens.push_back(str.substr(start, end - start));
start = end + 1;
}
tokens.push_back(str.substr(start));
return tokens;
}