Submission #74852081

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define int long long
#define T int t;cin>>t;while(t--)

const int N=105;
const int MOD=1e9+7;
const int INF=0x3f3f3f3f3f3f3f3f;

int t,x;
int a[N];

void solve(){
    cin>>t>>x;
    for(int i=0;i<=t;i++){
        cin>>a[i];
    }
    int last=a[0];
    cout<<0<<" "<<a[0]<<endl;
    for(int i=1;i<=t;i++){
        if(abs(a[i]-last)>=x){
            cout<<i<<" "<<a[i]<<endl;
            last=a[i];
        }
    }
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    //T
    solve();
    return 0;
}

Submission Info

Judge Result