Baekjoon #11441

#include <bits/stdc++.h>
using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int n; cin >> n;
	vector<int> sum_vector;

	sum_vector.push_back(0);

	for (int i = 0; i < n; i++) {
		int tmp = 0;
		cin >> tmp;
		sum_vector.push_back(sum_vector.back() + tmp);  // 누적 합을 저장
	}

	int m; cin >> m;

	for (int k = 0; k < m; k++) {
		int i, j;
		cin >> i >> j;
		int result = sum_vector[j] - sum_vector[i - 1]; // 해당하는 범위의 누적합을 구함
		cout << result << '\n';
	}

	return 0;
}

import java.util.*;
import java.lang.*;
import java.io.*;

public class Main {
    public static void main(String[] args) {
        FastReader rd = new FastReader();
        
        int N = rd.nextInt();
        int[] prefix_sum = new int[N + 1];

        for(int i = 1; i <= N; ++i) {
            prefix_sum[i] = prefix_sum[i - 1] + rd.nextInt();
        }

        int testcase = rd.nextInt();

        StringBuilder sb = new StringBuilder();
        for(int i = 0; i < testcase; ++i) {
            int s = rd.nextInt();
            int e = rd.nextInt();
            sb.append(prefix_sum[e] - prefix_sum[s - 1]);
            sb.append('\n');
        }
        System.out.println(sb);
    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while(st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() { return Integer.parseInt(next()); }
        long nextLong() { return Long.parseLong(next()); }
        double nextDouble() { return Double.parseDouble(next()); }
        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}

import sys

def input():
    return sys.stdin.readline()

n = int(input())

numbers = list(map(int, input().split(" ")))
solve_list = [0] # 누적합을 저장하기 위한 리스트
sum = 0

for i in numbers:
    sum += i
    solve_list.append(sum)

testcase = int(input())
for i in range(testcase):
    parts = list(map(int, input().split()))
    print(solve_list[parts[1]] - solve_list[parts[0] - 1])  # i ~ j 인덱스까지의 누적합