Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <utility>
- #include <cmath>
- #include <algorithm>
- using namespace std;
- int n,n1;
- int A[1001];
- pair <int, int> B[1001];
- int main()
- {
- cin>>n>>n1;
- int br=0;
- for (int i=0;i<n;i++)
- {
- cin>>A[i];
- if (i!=0)
- {
- int prov=false;
- for (int j=0;j<br;j++)
- if (B[j].first==A[i]) {prov=true;break;}
- if (prov==false) {B[br].first=A[i];B[br].second=0;;br++;}
- }
- else {B[br].first=A[i];B[br].second=0;br++;}
- }
- for (int i=0;i<br;i++)
- for (int j=0;j<n;j++)
- if (B[i].first==A[j]) B[i].second++;
- int br1=0;
- for (int g=0;g<20000000;g++)
- {
- if (br1==br+1) break;
- int maks=-10;
- int d=-10;
- for (int i=0;i<br;i++)
- if (B[i].first!=-1 && maks<B[i].second) {maks=B[i].second;d=i;}
- for (int i=0;i<maks;i++) cout<<B[d].first<<" ";
- B[d].first=-1;
- br1++;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement