fork download
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4. #define int long long
  5. #define pb push_back
  6. #define fi first
  7. #define se second
  8. #define nn '\n'
  9. #define pi pair<ll,ll>
  10. #define unmp unordered_map
  11. #define uns unordered_set
  12. #define TASK ""
  13. int mod = 1e9+7;
  14. const int N = 1e6 + 5;
  15. int MOD = 998244353;
  16. int bit[200000];
  17. string n;
  18. priority_queue<int> pq;
  19. signed main() {
  20. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  21. if(fopen(TASK".INP","r")){
  22. freopen(TASK".INP","r",stdin);
  23. freopen(TASK".OUT","w",stdout);
  24. }
  25. while(cin >> n){
  26. if(n[0] == '+' && pq.size() < 15000){
  27. int x = stoi(n.substr(1));
  28. pq.push(x);
  29. }
  30. else{
  31. if(!pq.empty()){
  32. int k = pq.top();
  33. pq.pop();
  34. while(pq.top() == k){
  35. pq.pop();
  36. }
  37. }
  38. }
  39. }
  40. cout << pq.size() << nn;
  41. while(!pq.empty()){
  42. cout << pq.top() << nn;
  43. pq.pop();
  44. }
  45. return 0;
  46. }
  47.  
Success #stdin #stdout 0.01s 5320KB
stdin
+1
+3
+2
+3
-
+4
+4
-
+2
+90
+77
+82
-
stdout
5
82
77
2
2
1