Problem:
Score : 700 points

Problem Statement

We have a directed weighted graph with N vertices.
Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.

In this graph, there is an edge from Vertex x to Vertex y for all pairs 1 \leq x,y \leq N, and its weight is {\rm min}(A_x,B_y).

We will consider a directed cycle in this graph that visits every vertex exactly once.
Find the minimum total weight of the edges in such a cycle.

Constraints

2 \leq N \leq 10^5

1 \leq A_i \leq 10^9

1 \leq B_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 B_1
A_2 B_2
:
A_N B_N

Output

Print the minimum total weight of the edges in such a cycle.

Sample Input 1

3
1 5
4 2
6 3

Sample Output 1

7

Consider the cycle 1→3→2→1. The weights of those edges are {\rm min}(A_1,B_3)=1, {\rm min}(A_3,B_2)=2 and {\rm min}(A_2,B_1)=4, for a total of 7.
As there is no cycle with a total weight of less than 7, the answer is 7.

Sample Input 2

4
1 5
2 6
3 7
4 8

Sample Output 2

10

Sample Input 3

6
19 92
64 64
78 48
57 33
73 6
95 73

Sample Output 3

227

Solution in Rust (1.15.1) (judge verdict: Accepted)

use std::cmp;
fn main() {
    let s = std::io::stdin();
    let mut sc = Scanner { stdin: s.lock() };
    let n: usize = sc.read();
    let ab = (0..n)
        .map(|_| (sc.read::<usize>(), sc.read::<usize>()))
        .collect::<Vec<_>>();
    let left_sum = ab.iter().map(|&(a, _)| a).sum::<usize>();
    let right_sum = ab.iter().map(|&(_, b)| b).sum::<usize>();

    let mut v = vec![];
    for i in 0..n {
        let (a, b) = ab[i];
        v.push((a, i, true));
        v.push((b, i, false));
    }
    v.sort();

    let mut count = vec![0; n];
    let mut sum = 0;
    for i in 0..n {
        let (v, i, _) = v[i];
        sum += v;
        count[i] += 1;
    }

    let mut ans = cmp::min(left_sum, right_sum);
    if count.iter().any(|&x| x == 2) {
        ans = cmp::min(ans, sum);
    } else if v[n - 1].1 != v[n].1 {
        ans = cmp::min(sum - v[n - 1].0 + v[n].0, ans);
    } else {
        if v[n - 2].1 != v[n].1 {
            ans = cmp::min(ans, sum - v[n - 2].0 + v[n].0);
        }
        if v[n - 1].1 != v[n + 1].1 {
            ans = cmp::min(ans, sum - v[n - 1].0 + v[n + 1].0);
        }
    }

    println!("{}", ans);
}

pub struct Scanner<R> {
    stdin: R,
}

impl<R: std::io::Read> Scanner<R> {
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }
    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}