CS371p

Write a program, ideally with a partner, to solve Voting [C++20 (g++ 8.3.0, C++20 standard, 2 sec, 512 MB, source 50 KB)] with an optimization that when reassigning the ballots of a loser, you do not iterate over all the ballots.
You may not use new, delete, malloc() or free(). You may use the STL.

create a private code repo (https://gitlab.com/GitLabID/cs371p-voting/)
enable issues here: Settings -> General -> Visibility, project features, permissions -> Issues
create the following issue labels here: Issues -> New Issue -> Labels -> Manage project labels (labels are case sensitive):
- build (Titanium yellow)
- code (Dark violet)
- documentation (Gray)
- tests (Dark coral)
import the issues: Issues -> Import issues -> Import CSV
close all provided issues
add and close new issues as you debug and develop your solution
provide your GitLab URL on the Canvas assignment

Assets	Location
Correctness 3 tests at least 2 tests to be eligible to resubmit	HackerRank hr_Voting.cpp
Build Files .gitignore .gitlab-ci.yml Makefile README.md	GitLab
Issues add at least 5 more issues	GitLab
Unit Tests between 10 and 20 tests run gcov run Valgrind	test_Voting.cpp
Acceptance Tests between 80 and 100 tests, between 3,000 and 4,000 lines, total run checktestdata do not run gcov do not run Valgrind	Voting.ctd.txt run_Voting.cpp https://gitlab.com/gpdowning/cs371p-voting-tests/gpdowning-Voting.in.txt via merge request https://gitlab.com/gpdowning/cs371p-voting-tests/gpdowning-Voting.out.txt via merge request
Continuous Integration	GitLab Pipelines
Code assertions run astyle run cppcheck	Voting.hpp
Documentation create inline comments if you need to explain the why of a particular implementation run doxygen (Voting.hpp only) git log	Voting.html Voting.log.txt