algorithm'''problem solve
[백준]10773-제로(설명X)
JunHwa Park
2020. 2. 2. 14:30
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 | #include <cstdio> #include <stack> using namespace std; int main() { stack<int> stk; int K; scanf("%d", &K); for (size_t i = 0; i < K; i++) { int num; scanf("%d", &num); if (num == 0) stk.pop(); else stk.push(num); } int sum = 0; int size = stk.size(); for (size_t i = 0; i < size; i++) { sum += stk.top(); stk.pop(); } printf("%d", sum); return 0; } | cs |