Submission #806484

---

Source Code Expand

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;

public class Don
{
    public Don() { }
    private Reader r = new Reader();

    public void Solve()
    {
        var N = r.nextInt();
        var list = new List<int>();

        for(var i = 0; i < 2 * N; i++)
        {
            var L = r.nextInt();
            list.Add(L);
        }
        list.Sort();

        var ret = 0;
        for(var i = 0; i < (2 * N) - 1; i += 2)
        {
            if (list[i] == list[i + 1])
            {
                ret += list[i];
            } else
            {
                ret += list[i] > list[i + 1] ? list[i + 1] : list[i];
            }
        }

        Console.WriteLine(ret);

    }

    public static void Main(string[] args)
    {
        new Don().Solve();
    }

}

class Reader
{
    string[] s;
    int i;
    char[] cs = new char[] { ' ' };

    public Reader()
    {
        s = new string[0];
        i = 0;
    }

    public string next()
    {
        if (i < s.Length)
            return s[i++];
        var input = Console.ReadLine();
        while (input == "")
            input = Console.ReadLine();
        s = input.Split(cs, StringSplitOptions.RemoveEmptyEntries);
        i = 0;
        return next();
    }

    public int nextInt()
    {
        return int.Parse(next());
    }

    public long nextLong()
    {
        return long.Parse(next());
    }

    public double nextDouble()
    {
        return double.Parse(next());
    }

}

Submission Info

Judge Result