Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main()
- {
- int n, m, v[101][101];
- cin >> n >> m;
- for (int i = 1; i <= n; ++i)
- for (int j = 1; j <= m; ++j)
- cin >> v[i][j];
- int fr[1000001] = {0}, maxfr = -1;
- for (int i = 1; i <= n; ++i)
- {
- for (int j = 1; j <= m; ++j)
- {
- fr[v[i][j]]++;
- if (fr[v[i][j]] > maxfr)
- maxfr = fr[v[i][j]];
- }
- }
- int w[1000001] = {0}, k = 0;
- for (int i = 1; i <= n; ++i)
- {
- for (int j = 1; j <= m; ++j)
- {
- if (fr[v[i][j]] == maxfr)
- {
- w[++k] = v[i][j];
- }
- }
- }
- int dontstop = 1;
- while (dontstop)
- {
- int stop = 1;
- for (int i = 1; i < k; ++i)
- {
- if (w[i] > w[i + 1])
- {
- int aux = w[i];
- w[i] = w[i + 1];
- w[i + 1] = aux;
- stop = 0;
- }
- }
- if (stop == 1)
- dontstop = 0;
- }
- for (int i = 1; i < k; ++i)
- if (w[i] != w[i + 1])
- cout << w[i] << " ";
- cout << w[k];
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement