diff options
| author | omagdy7 <omar.professional8777@gmail.com> | 2022-11-05 01:28:02 +0200 |
|---|---|---|
| committer | omagdy7 <omar.professional8777@gmail.com> | 2022-11-05 01:28:02 +0200 |
| commit | c52b36c6a37fdb1d1de146d3939cb42e2c691f44 (patch) | |
| tree | b13bbc546bf9505c875dde5d26424d39d23054c9 /HackerRank/CountingSort2 | |
| parent | b79a55ceee2f4532ef6621f9d86c6c61543ce6c9 (diff) | |
| download | competitive-programming-c52b36c6a37fdb1d1de146d3939cb42e2c691f44.tar.xz competitive-programming-c52b36c6a37fdb1d1de146d3939cb42e2c691f44.zip | |
Solved 6 problem in filtrationContest and restructured the repo
Diffstat (limited to 'HackerRank/CountingSort2')
| -rw-r--r-- | HackerRank/CountingSort2/CountingSort2.cpp | 21 |
1 files changed, 21 insertions, 0 deletions
diff --git a/HackerRank/CountingSort2/CountingSort2.cpp b/HackerRank/CountingSort2/CountingSort2.cpp new file mode 100644 index 0000000..29fb91c --- /dev/null +++ b/HackerRank/CountingSort2/CountingSort2.cpp @@ -0,0 +1,21 @@ +#include<bits/stdc++.h> + +using namespace std; + +int main() { + int n, x; + cin >> n; + vector<int> v; + vector<int> freq(100); + for(int i = 0; i < n; i ++){ + cin >> x; + freq[x]+=1; + } + for(int i = 0; i < freq.size(); i++){ + for(int j = 0; j < freq[i]; j++){ + cout << i << " "; + } + } + cout << endl; + return 0; +} |
