MCPcopy Create free account
hub / github.com/Vishruth-S/CompetitiveCode / main

Function main

Hackerrank_problems/Max_Min/solution.cpp:34–63  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

32}
33
34int main()
35{
36 ofstream fout(getenv("OUTPUT_PATH"));
37
38 int n;
39 cin >> n;
40 cin.ignore(numeric_limits<streamsize>::max(), '\n');
41
42 int k;
43 cin >> k;
44 cin.ignore(numeric_limits<streamsize>::max(), '\n');
45
46 vector<int> arr(n);
47
48 for (int i = 0; i < n; i++) {
49 int arr_item;
50 cin >> arr_item;
51 cin.ignore(numeric_limits<streamsize>::max(), '\n');
52
53 arr[i] = arr_item;
54 }
55
56 int result = maxMin(k, arr);
57
58 fout << result << "\n";
59
60 fout.close();
61
62 return 0;
63}

Callers

nothing calls this directly

Calls 2

maxFunction · 0.85
maxMinFunction · 0.85

Tested by

no test coverage detected