Advertisement
7oSkaaa

G - Assiut ACPC Club and Coach Hussien (White)

Mar 19th, 2022
116
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.10 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. #define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
  6. #define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
  7. #define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
  8. #define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
  9. #define fixed(n) fixed << setprecision(n)
  10. #define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  11. #define fill(vec, value) memset(vec, value, sizeof(vec));
  12. #define Num_of_Digits(n) ((int)log10(n) + 1)
  13. #define mod_combine(a, b, m) (((a % m) * (b % m)) % m)
  14. #define all(vec) vec.begin(), vec.end()
  15. #define rall(vec) vec.rbegin(), vec.rend()
  16. #define sz(x) int(x.size())
  17. #define debug(x) cout << #x << ": " << (x) << "\n";
  18. #define fi first
  19. #define se second
  20. #define Pair pair < long long, long long >
  21. #define ll long long
  22. #define ull unsigned long long
  23. #define Mod  1'000'000'007
  24. #define OO 2'000'000'000
  25. #define EPS 1e-9
  26. #define PI acos(-1)
  27.  
  28. template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
  29.     for (auto &x: v) in >> x;
  30.     return in;
  31. }
  32.  
  33. template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) {
  34.     for (const T &x: v) out << x << ' ';
  35.     return out;
  36. }
  37.  
  38. void AhMeD_HoSSaM(){
  39.     ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  40.     #ifndef ONLINE_JUDGE
  41.         freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  42.     #endif
  43. }
  44.  
  45. void Solve(){
  46.     int n;
  47.     cin >> n;
  48.     int arr[n], love[] = {5, 103, 320, 7000, 9120, 1122, 51345};
  49.     for(auto& i : arr) cin >> i;
  50.     ll dollars = 0;
  51.     for(int i = 0; i < n; i++){
  52.         int min_dollars = INT_MAX;
  53.         for(int j = 0; j < 7; j++)
  54.             min_dollars = min(min_dollars, abs(love[j] - arr[i]));
  55.         dollars += min_dollars;
  56.     }
  57.     cout << dollars << '\n';
  58. }
  59.  
  60. int main(){
  61.     AhMeD_HoSSaM();
  62.     int t = 1;
  63.     //cin >> t;
  64.     while(t--)
  65.         Solve();
  66.     return 0;
  67. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement