Final Capstone STL Algorithms Project

Hard STL Algorithms PRO

🔒 Login to Unlock

Problem Statement

Write a C++ program implementing an advanced data processing engine that utilizes multiple STL algorithms (`sort`, `transform`, `accumulate`, `remove_if`, `min_element`, `max_element`) to analyze financial transaction records.

Input Format

Number of transactions N, followed by N space-separated transaction amounts (can be positive or negative).

Output Format

Print total net sum, maximum earning, minimum expenditure, and sorted positive transactions separated by a space.

Constraints

1 <= N <= 50

Sample Input

5
100 -50 200 -20 300

Sample Output

Net: 530.00
Max Earning: 300.00
Min Expenditure: -50.00
Positive: 100.00 200.00 300.00

Explanation

Capstone project integrating sorting, accumulation, custom filtering, and min/max algorithms for advanced data analytics.

Starter Code

#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <iomanip>

int main() {
    int n;
    if (std::cin >> n) {
        std::vector<double> tx(n);
        for (int i = 0; i < n; i++) std::cin >> tx[i];

        // Implement transaction accumulation, min/max finding, filtering, and sorting here

    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock