제출 #412794

#제출 시각아이디문제언어결과실행 시간메모리
412794MasterTasterHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
0 / 100
2 ms716 KiB
#include <bits/stdc++.h>

#define pb push_back
#define ll long long
#define pii pair<int, int>
#define xx first
#define yy second
#define MAXN 5010

using namespace std;

int n, m, a[MAXN];

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

    cin>>n>>m;

    for (int i=0; i<n; i++) cin>>a[i];

    while (m--)
    {
        int l, r, k; cin>>l>>r>>k;
        l--; r--;

        vector<int> koji;
        for (int i=l; i<=r; i++) koji.pb(a[i]);
        sort(koji.begin(), koji.end());

        int minn=koji[0]; int maxx;
        for (int i=koji.size()-1; i>=0; i--)
        {
            if (koji[i]!=a[i+l]) { maxx=koji[i]; break; }
        }
        //cout<<minn<<" "<<maxx<<endl;
        cout<<(((maxx+minn)<=k) ? 1 : 0)<<endl;
    }

}

컴파일 시 표준 에러 (stderr) 메시지

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:36:22: warning: 'maxx' may be used uninitialized in this function [-Wmaybe-uninitialized]
   36 |         cout<<(((maxx+minn)<=k) ? 1 : 0)<<endl;
      |                 ~~~~~^~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...