fork download
copy 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2024-08-24 00:06:46
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2024-11-26 23:27:32
  6. */
  7. #include <bits/stdc++.h>
  8. // #pragma GCC optimize("O3")  
  9. // #pragma GCC optimize("unroll-loops")  
  10. // #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")  
  11. using namespace std;
  12. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
  13. #define int long long
  14. #define ull unsigned long long
  15. #define sz(x) x.size()
  16. #define sqr(x) (1LL * (x) * (x))
  17. #define all(x) x.begin(), x.end()
  18. #define fill(f,x) memset(f,x,sizeof(f))
  19. #define FOR(i,l,r) for(int i=l;i<=r;i++)
  20. #define FOD(i,r,l) for(int i=r;i>=l;i--)
  21. #define ii pair<int,int>
  22. #define iii pair<int,ii>
  23. #define di pair<ii,ii>
  24. #define vi vector<int>
  25. #define vii vector<ii>
  26. #define mii map<int,int>
  27. #define fi first
  28. #define se second
  29. #define pb push_back
  30. #define MOD 1000000007
  31. #define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))
  32. #define YES cout << "YES\n"
  33. #define NO cout << "NO\n"
  34. #define MASK(i) (1LL << (i))
  35. #define c_bit(i) __builtin_popcountll(i)
  36. #define BIT(x,i) ((x) & MASK(i))
  37. #define SET_ON(x,i) ((x) | MASK(i))
  38. #define SET_OFF(x,i) ((x) & ~MASK(i))
  39. #define oo 1e18
  40. #define name ""
  41. #define endl '\n'
  42. #define time() cerr << endl << "-------------Time:" << 1000.0 * clock() / CLOCKS_PER_SEC << "ms.";
  43. template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
  44. template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
  45. const int N = (int)1e6+10;	
  46. ii a[N];
  47. int n;
  48.  
  49. namespace hungeazy {
  50.  
  51. 	void solve(void)
  52. 	{
  53. 		int sum = 0;
  54. 		FOR(i,1,n) sum += a[i].se;
  55. 		sort(a+1,a+n+1);
  56. 		priority_queue<int,vi,greater<int>> q;
  57. 		FOR(i,1,n)
  58. 			if (a[i].fi > (int)q.size()) q.push(a[i].se);
  59. 			else if (q.top() < a[i].se)
  60. 			{
  61. 				q.pop();
  62. 				q.push(a[i].se);
  63. 			}
  64. 		int ans = 0;
  65. 		while (!q.empty()) ans += q.top(), q.pop();
  66. 		cout << abs(sum-ans);
  67. 	}
  68.  
  69. }
  70.  
  71. signed main()
  72. {
  73.     fast;
  74.     if (fopen(name".inp","r"))
  75.     {
  76.     	freopen(name".inp","r",stdin);
  77.     	freopen(name".out","w",stdout);
  78.     }
  79.     cin >> n;
  80.     FOR(i,1,n) cin >> a[i].fi;
  81.     FOR(i,1,n) cin >> a[i].se;
  82.    	hungeazy::solve();
  83.     time();
  84.     return 0;
  85. }
Success #stdin #stdout #stderr 0s 5324KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
stderr
copy 
-------------Time:4.431ms.
https://ideone.com/bSRSpF
language:
C++14 (gcc 8.3)
created:
5 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!