aboutsummaryrefslogtreecommitdiff
path: root/contests/21-04-2022(Div.4)/B.cpp
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
commit3a89fc707253f75f46fd5a4822817f1fd5156c40 (patch)
tree474b08b187895af91c10838aae21142b2ba2514d /contests/21-04-2022(Div.4)/B.cpp
parentf5ff62a26052f084b6b807cba220c86785fd45e3 (diff)
downloadcompetitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.tar.xz
competitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.zip
Made that every problem is its own folder to make building the code a smooth operation with a shortcut
Diffstat (limited to 'contests/21-04-2022(Div.4)/B.cpp')
-rw-r--r--contests/21-04-2022(Div.4)/B.cpp30
1 files changed, 0 insertions, 30 deletions
diff --git a/contests/21-04-2022(Div.4)/B.cpp b/contests/21-04-2022(Div.4)/B.cpp
deleted file mode 100644
index d1b3e98..0000000
--- a/contests/21-04-2022(Div.4)/B.cpp
+++ /dev/null
@@ -1,30 +0,0 @@
-#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;
- }
-}