-
Notifications
You must be signed in to change notification settings - Fork 2
/
ElectronicsShop.cpp
139 lines (105 loc) · 3.26 KB
/
ElectronicsShop.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
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
#include <bits/stdc++.h>
using namespace std;
vector<string> split_string(string);
/*
* Complete the getMoneySpent function below.
*/
int getMoneySpent(vector<int> keyboards, vector<int> drives, int b) {
int cost = -1, maxCost = -1;
bool flag = false;
sort(keyboards.begin(), keyboards.end());
sort(drives.begin(), drives.end());
for(int i = keyboards.size()-1; i >= 0; --i) {
for(int j = drives.size()-1; j >= 0; --j) {
cost = keyboards[i] + drives[j];
if(cost == b) {
maxCost = b;
flag = true;
break;
}
else if(cost < b) {
maxCost = max(maxCost, cost);
break;
}
}
if(flag) {
break;
}
}
//int i = keyboards.size()-1, j = drives.size()-1;
// while (true) {
// cost = keyboards[i] + drives[j];
// if(cost > b) {
// if(keyboards[i] < drives[j]) {
// --i;
// }
// else {
// --j;
// }
// if(i < 0 || j < 0) {
// cost = -1;
// break;
// }
// }
// else if(cost == b) {
// break;
// }
// else {
// break;
// }
// }
return maxCost;
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string bnm_temp;
getline(cin, bnm_temp);
vector<string> bnm = split_string(bnm_temp);
int b = stoi(bnm[0]);
int n = stoi(bnm[1]);
int m = stoi(bnm[2]);
string keyboards_temp_temp;
getline(cin, keyboards_temp_temp);
vector<string> keyboards_temp = split_string(keyboards_temp_temp);
vector<int> keyboards(n);
for (int keyboards_itr = 0; keyboards_itr < n; keyboards_itr++) {
int keyboards_item = stoi(keyboards_temp[keyboards_itr]);
keyboards[keyboards_itr] = keyboards_item;
}
string drives_temp_temp;
getline(cin, drives_temp_temp);
vector<string> drives_temp = split_string(drives_temp_temp);
vector<int> drives(m);
for (int drives_itr = 0; drives_itr < m; drives_itr++) {
int drives_item = stoi(drives_temp[drives_itr]);
drives[drives_itr] = drives_item;
}
/*
* The maximum amount of money she can spend on a keyboard and USB drive, or -1 if she can't purchase both items
*/
int moneySpent = getMoneySpent(keyboards, drives, b);
fout << moneySpent << "\n";
fout.close();
return 0;
}
vector<string> split_string(string input_string) {
string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) {
return x == y and x == ' ';
});
input_string.erase(new_end, input_string.end());
while (input_string[input_string.length() - 1] == ' ') {
input_string.pop_back();
}
vector<string> splits;
char delimiter = ' ';
size_t i = 0;
size_t pos = input_string.find(delimiter);
while (pos != string::npos) {
splits.push_back(input_string.substr(i, pos - i));
i = pos + 1;
pos = input_string.find(delimiter, i);
}
splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));
return splits;
}