Problem:Given an array of integers, sort the array according to frequency of elements. For example, if the input array is {2, 3, 2, 4, 5, 12, 2, 3, 3, 3, 12}, then modify the array to {3, 3, 3, 3, 2, 2, 2, 12, 12, 4, 5}.
If frequencies of two elements are same, print them in increasing order.
The problem was given at Oracle Interview.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 |
#include <stdio.h> #include <vector> #include <algorithm> using namespace std; struct st{ int fr; int num; }; bool cmp(st a,st b) { if(a.fr>b.fr) return 1; else if(a.fr==b.fr) { if(a.num>b.num) return 0; return 1; } else return 0; } int main() { //code int t,n,a; st s; //st vb[65]; vector<st> vb; scanf("%d",&t); int arr[62]; while(t--) { vb.clear(); scanf("%d",&n); for(int i=0;i<62;i++) arr[i]=0; for(int i=0;i<n;i++) { scanf("%d",&a); arr[a]+=1; } for(int i=0;i<62;i++) { if(arr[i]!=0) { s.fr=arr[i]; s.num=i; //vb[idx]=s; vb.push_back(s); } } //sort(vb,vb+idx,cmp); sort(vb.begin(),vb.end(),cmp); for(int i=0;i<vb.size();i++) { int fre=vb[i].fr; int nm=vb[i].num; for(int j=1;j<=fre;j++) printf("%d ",nm); } printf("\n"); } return 0; } |