Submission #990031

---

Source Code Expand

#include <string>
#include <iostream>

#include <utility>
#include <algorithm>
#include <array>
#include <vector>
#include <deque>
#include <unordered_map>
#include <unordered_set>

int main () {

  std::string line;
  std::getline(std::cin, line);

  char * p;

  p = &line[0];
  int N = std::strtol(p, &p, 0);
  std::vector<int> L(2 * N);

  std::getline(std::cin, line);
  p = &line[0];
  for (int i = 0; i < 2 * N; ++i) {
    L[i] = std::strtol(p, &p, 0);
  }
  std::sort(L.begin(), L.end());

  int X = 0;
  for (int i = 0; i < N; ++i) {
    X += L[2 * i];
  }
  std::cout << X << std::endl;
}

Submission Info

Judge Result