(10773) 제로

https://www.acmicpc.net/problem/10773

단계별로 풀어보기

16단계(스택, 큐, 덱 1) 2번째

 

 

 

#include <iostream>
#include <stack>
using namespace std;

int main() 
{
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  
  stack<int> s;
  int k, ans= 0;
  
  cin >> k;
  
  while(k--){
    int t;
    
    cin >> t;
    
    t?s.push(t):s.pop();
  }
  
  while(!s.empty()){
    ans+= s.top();
    s.pop();
  }
  
  cout << ans;
  
  return 0;
}