Submission #74892523

---

Source Code Expand

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

int main() {
    int T, X;
    cin >> T >> X;
    
    vector<int> A(T + 1);
    for (int i = 0; i <= T; i++) {
        cin >> A[i];
    }
    vector<pair<int, int>> saved;
    saved.push_back({0, A[0]});
    int last_saved = A[0];
    for (int i = 1; i <= T; i++) {
        int diff = abs(A[i] - last_saved);
        if (diff >= X) {
            saved.push_back({i, A[i]});
            last_saved = A[i];
        }
    }
    for (auto& p : saved) {
        cout << p.first << " " << p.second << endl;
    }
    
    return 0;
}

Submission Info

Judge Result