aboutsummaryrefslogtreecommitdiff
path: root/21-04-2022(Div.4)/B.cpp
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-04-30 01:13:40 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-04-30 01:13:40 +0200
commita0d7b8320a8996eee0ed957b79c3a882f8b47146 (patch)
tree76242ae2b19bad00796ed6d0104da8a0e4a99abe /21-04-2022(Div.4)/B.cpp
downloadcompetitive-programming-a0d7b8320a8996eee0ed957b79c3a882f8b47146.tar.xz
competitive-programming-a0d7b8320a8996eee0ed957b79c3a882f8b47146.zip
Added all current problems
Diffstat (limited to '21-04-2022(Div.4)/B.cpp')
-rw-r--r--21-04-2022(Div.4)/B.cpp30
1 files changed, 30 insertions, 0 deletions
diff --git a/21-04-2022(Div.4)/B.cpp b/21-04-2022(Div.4)/B.cpp
new file mode 100644
index 0000000..d1b3e98
--- /dev/null
+++ b/21-04-2022(Div.4)/B.cpp
@@ -0,0 +1,30 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+auto solve(map<int, int> m){
+ for(auto x : m){
+ if(x.second >= 3){
+ return x.first;
+ }
+ }
+ return -1;
+}
+
+int main(){
+ int tt, x, n;
+ cin >> tt;
+ while(tt--){
+ map<int, int> frq;
+ vector<int> v;
+ cin >> n;
+ for(int i = 0; i < n; i++){
+ cin >> x;
+ frq[x]++;
+ }
+ // for(auto &x : frq){
+ // v.push_back(x.second);
+ // }
+ cout << solve(frq) << endl;
+ }
+}