AdventofCode2024/solution.cpp

33 lines
850 B
C++
Raw Normal View History

2025-04-03 18:09:51 +00:00
#include <day_01/common.hpp>
#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <vector>
#include <cmath>
int main() {
std::vector<int> left, right;
long dist = 0;
try {
// day_01::parseInput("test-input.txt", left, right);
day_01::parseInput("input.txt", left, right);
}
catch (const std::exception& e) {
std::cerr << e.what();
return 1;
}
size_t numPairs = left.size();
std::cout << numPairs << '\n';
for (size_t i = 0; i < numPairs; i++) {
int templ = day_01::findAndEjectMin(left);
int tempr = day_01::findAndEjectMin(right);
dist += std::abs(templ - tempr);
// std::cout << "most min left:" << " " << templ << "; most min right:" << " " << tempr << '\n';
}
std::cout << dist << '\n';
return 0;
}