Submission 1082 | MatCom Online Grader

Id	Date	User	Problem	Result	Time	Mem	Lang
1082	20/05/2013 15:11:57	otero1991	A - Fito el hacker	Accepted	16	1.4 KiB	GNU G++ 5.1.0

Code

#include <cstdio>
#include <sstream>
#include <iostream>

#include <set>
#include <map>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <complex>
#include <cstring>

#include <ctime>
#include <cmath>
#include <cstdlib>
#include <algorithm>
using namespace std;

#define FOR(i,n) for (int i = 1; i <= (n); ++i)
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define REPI(i,c) for (typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
#define ALL(c) c.begin(), c.end()
#define SZ(x) ((int)(x).size())
#define MP make_pair

#define DB(x) cout << #x << " = " << x << endl;
#define CK(x) if(!(x)) cout << '(' << #x << ") is false!!!" << endl;

typedef long long int64;
typedef unsigned long long uint64;
typedef complex<int> point;
typedef pair<int, int> pii;
typedef vector<int> vi;

const int INF = 1 << 30;
const double EPS = 1e-7;
const int MAXN = 1010;

map<int,int> cant;
int a[MAXN];
int pos[MAXN];
map<int,int> first;
bool cmp(int i, int j)
{
	if(cant[a[i]] != cant[a[j]])return cant[a[i]] > cant[a[j]];
	else return first[a[i]] < first[a[j]];
}

int main()
{
	ios::sync_with_stdio(false);

int n,c; cin>>n>>c;
	for(int i = 0; i < n; i++)
	{
		cin>>a[i];
		cant[a[i]]++;
		pos[i] = i;
		if(!first[a[i]])first[a[i]] = i+1;
	}
	sort(pos,pos+n,cmp);
	for(int i = 0; i < n; i++)
		cout<<a[pos[i]]<<(i==n-1?"\n":" ");
    return 0;
}// UH++

Judgement Details

Test 01: 0.018 0.000 1400K ok
Test 02: 0.017 0.000 1404K ok
Test 03: 0.038 0.000 1404K ok
Test 04: 0.012 0.000 1400K ok
Test 05: 0.013 0.000 1404K ok
Test 06: 0.014 0.000 1412K ok
Test 07: 0.021 0.000 1400K ok
Test 08: 0.014 0.016 1412K ok
Test 09: 0.012 0.000 1408K ok
Test 10: 0.023 0.000 1400K ok
Accepted

Matcom Online Grader