2017 Netease Clear Redundancy

2017.netease.clear.redundancy.cpp

#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <cmath>
#include <map>
#include <unordered_map>
using namespace std;

#define ff(i, n) for (int i = 0, END = (n); i < END; i ++)
#define fff(i, n, m) for (int i = (n), END = (m); i <= END; i ++)
#define dff(i, n, m) for (int i = (n), END = (m); i >= END; i --)
#define travel(e, first) for (int e = first, v = vv[first]; ~e; e = nxt[e], v = vv[e])
#define clr(a, b) memset(a, b, sizeof(a))
typedef long long ll;

int main() {
    int n;
    while (scanf("%d", &n) == 1) {
        unordered_map<int, int> seq;
        ff (i, n) {
            int v; scanf("%d", &v);
            seq[v] = i;
        }

        map<int, int> sorted;
        for (auto it: seq) {
            sorted[it.second] = it.first;
        }

        for (auto it: sorted) {
            printf("%d", it.second);
            putchar(it.first == n - 1 ? '\n' : ' ');
        }
    }
}