forked from kilian-hu/hackerrank-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstub.cc
77 lines (51 loc) · 1.33 KB
/
stub.cc
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
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
/*
* Complete the 'filledOrders' function below.
*
* The function is expected to return an INTEGER.
* The function accepts following parameters:
* 1. INTEGER_ARRAY order
* 2. INTEGER k
*/
int filledOrders(vector<int> order, int k) {
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string order_count_temp;
getline(cin, order_count_temp);
int order_count = stoi(ltrim(rtrim(order_count_temp)));
vector<int> order(order_count);
for (int i = 0; i < order_count; i++) {
string order_item_temp;
getline(cin, order_item_temp);
int order_item = stoi(ltrim(rtrim(order_item_temp)));
order[i] = order_item;
}
string k_temp;
getline(cin, k_temp);
int k = stoi(ltrim(rtrim(k_temp)));
int result = filledOrders(order, k);
fout << result << "\n";
fout.close();
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}