Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <array>
- #include <vector>
- const int maxSize = 100;
- std::array<int, maxSize> readInput(int& arrSize) {
- std::array<int, maxSize> arr{};
- std::cin >> arrSize;
- for (int i = 0; i < arrSize; ++i) {
- std::cin >> arr[i];
- }
- return arr;
- }
- int findAverage(std::array<int, maxSize>& nums, int& arrSize, int& average) {
- int sum = 0;
- for (int i = 0; i < arrSize; ++i) {
- sum += nums[i];
- }
- average = sum / arrSize;
- return average;
- }
- std::vector<int> removeUnderAverage(std::array<int, maxSize>& nums, int& arrSize, std::vector<int>& underAverage, int& average) {
- for (int i = 0; i < arrSize; ++i) {
- if (nums[i] <= average) {
- underAverage.push_back(nums[i]);
- }
- }
- return underAverage;
- }
- void findOddAndEvenSum(std::vector<int>& underAverage) {
- int evenSum = 0;
- int oddSum = 0;
- for (int i = 0; i < underAverage.size(); ++i) {
- if (i % 2 == 0) {
- evenSum += underAverage[i];
- }
- else {
- oddSum += underAverage[i];
- }
- }
- std::cout << evenSum * oddSum;
- }
- int main() {
- int arrSize = 0;
- std::array<int, maxSize> nums = readInput(arrSize);
- int average = 0;
- findAverage(nums, arrSize, average);
- std::vector<int> underAverage;
- removeUnderAverage(nums, arrSize, underAverage, average);
- findOddAndEvenSum(underAverage);
- }
Advertisement
Add Comment
Please, Sign In to add comment