oj.uz

Submission #344240

# Submission time Handle Problem Language Result Execution time Memory
344240 2021-01-05T10:10:41 Z infertechno2 Money (IZhO17_money) C++14
0 / 100
 1 ms 364 KB 
#include <iostream>

using namespace std;

typedef long long ll;

    ll all_nums[1000001];

int main(){
    ll n,very_greedy=1;
    cin>>n;
    cin>>all_nums[0];
    for(ll i=1;i<n;i++){
        cin>>all_nums[i];
        if(all_nums[i]<all_nums[i-1])very_greedy++;
    }

    cout<<very_greedy<<endl;
    return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -