Try to use more idiomatic C++
This commit is contained in:
parent
d9bdd40d0a
commit
e2c1c14b3d
33
q1.cpp
33
q1.cpp
@ -1,6 +1,7 @@
|
||||
#include <algorithm>
|
||||
#include <fstream>
|
||||
#include <iostream>
|
||||
#include <numeric>
|
||||
#include <sstream>
|
||||
#include <unordered_map>
|
||||
#include <vector>
|
||||
@ -9,17 +10,10 @@ int q1(std::ifstream &in) {
|
||||
std::vector<int> l1;
|
||||
std::vector<int> l2;
|
||||
|
||||
// for (std::string line; std::getline(in, line);) {
|
||||
// std::string left = line.substr(0, line.find(" "));
|
||||
// std::string right = line.substr(line.rfind(" "));
|
||||
// l1.push_back(std::stoi(left));
|
||||
// l2.push_back(std::stoi(right));
|
||||
// }
|
||||
|
||||
for (std::string line; std::getline(in, line);) {
|
||||
int left, right;
|
||||
std::stringstream s(line);
|
||||
s >> left >> right;
|
||||
std::stringstream(line) >> left >> right;
|
||||
|
||||
l1.push_back(left);
|
||||
l2.push_back(right);
|
||||
}
|
||||
@ -29,7 +23,7 @@ int q1(std::ifstream &in) {
|
||||
|
||||
int sum = 0;
|
||||
for (int i = 0; i < l1.size(); i++) {
|
||||
sum += abs(l1[i]-l2[i]);
|
||||
sum += abs(l1[i] - l2[i]);
|
||||
}
|
||||
return sum;
|
||||
}
|
||||
@ -39,19 +33,16 @@ int q2(std::ifstream &in) {
|
||||
std::unordered_map<int, int> l2;
|
||||
|
||||
for (std::string line; std::getline(in, line);) {
|
||||
std::string left = line.substr(0, line.find(" "));
|
||||
std::string right = line.substr(line.rfind(" "));
|
||||
l1.push_back(std::stoi(left));
|
||||
l2[std::stoi(right)]++;
|
||||
int left, right;
|
||||
std::stringstream(line) >> left >> right;
|
||||
|
||||
l1.push_back(left);
|
||||
l2[right]++;
|
||||
}
|
||||
|
||||
std::sort(l1.begin(), l1.end());
|
||||
|
||||
int sum = 0;
|
||||
for (int i = 0; i < l1.size(); i++) {
|
||||
sum += l1[i] * l2[l1[i]];
|
||||
}
|
||||
return sum;
|
||||
return std::accumulate(l1.begin(), l1.end(), 0, [&l2](int acc, int curr) {
|
||||
return acc + curr * l2[curr];
|
||||
});
|
||||
}
|
||||
|
||||
int main() {
|
||||
|
Loading…
Reference in New Issue
Block a user