Blame view

SearchingSortingandBasicDataStructures/BinarySearch/Problem2/GeekAndHisMarks.cpp .cpp 791 Bytes
743b077f4   Ronaldo   Update.
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
  //
  // Created by ronal on 2/11/2023.
  // Problem Description Link.
  // https://practice.geeksforgeeks.org/problems/geek-and-his-marks/0
  
  #include <bits/stdc++.h>
  
  using namespace std;
  
  int main() {
      vector<int> v;
      int tests, size, querys, key, value;
  
      cin >> tests;
      for(int i = 0; i < tests; i++){
          cin >> size;
          for(int j = 0; j < size; j++){
              cin >> value;
              v.push_back(value);
          }
  
          cin >> querys;
          for(int k = 0; k < querys; k++){
              cin >> key;
              long long int sum = 0;
              for(int p = 0; p < v.size(); p++){
                  if(v[p] > key){
                      sum += v[p];
                  }
              }
              cout << sum << "
  ";
          }
          v.clear();
      }
      return 0;
  }