Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int main() {
- int n = 0;
- cin >> n;
- vector<int> mod(160);
- vector<int> mod7(160);
- int now = 0;
- while (cin >> now) {
- if (mod7[now % 160] < now && now % 7 == 0) {
- mod7[now % 160] = now;
- }
- else if (mod[now % 160] < now) {
- mod[now % 160] = now;
- }
- }
- int maxmod = mod[distance(begin(mod), max_element(begin(mod), end(mod)))];
- int maxmod7 = mod7[distance(begin(mod7), max_element(begin(mod7), end(mod7)))];
- mod7[distance(begin(mod7), max_element(begin(mod7), end(mod7)))] = 0;
- int maxmod72 = mod7[distance(begin(mod7), max_element(begin(mod7), end(mod7)))];
- if (maxmod + maxmod7 > maxmod7 + maxmod72) {
- cout << maxmod << " " << maxmod7;
- }
- else {
- cout << maxmod7 << " " << maxmod72;
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment