Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- vector<string> split_string(string);
- void insertionSort(vector<int>& arr) {
- int key, j;
- for (int i = 1; i < arr.size(); i++) {
- key = arr[i];
- for (j = i - 1; j >= 0; j--) {
- if (arr[j] > key) {
- arr[j + 1] = arr[j];
- } else {
- break;
- }
- }
- arr[j + 1] = key;
- }
- }
- // Complete the birthdayCakeCandles function below.
- int birthdayCakeCandles(vector<int> arr) {
- insertionSort(arr);
- int heighest = arr[arr.size() - 1];
- int count = 1;
- for(int i = 0; i < arr.size() - 1; i++) {
- if (heighest == arr[i]) {
- count++;
- }
- }
- return count;
- }
- int main()
- {
- ofstream fout(getenv("OUTPUT_PATH"));
- int ar_count;
- cin >> ar_count;
- cin.ignore(numeric_limits<streamsize>::max(), '\n');
- string ar_temp_temp;
- getline(cin, ar_temp_temp);
- vector<string> ar_temp = split_string(ar_temp_temp);
- vector<int> ar(ar_count);
- for (int i = 0; i < ar_count; i++) {
- int ar_item = stoi(ar_temp[i]);
- ar[i] = ar_item;
- }
- int result = birthdayCakeCandles(ar);
- fout << result << "\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;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement