oj.uz

Submission #865974

# Submission time Handle Problem Language Result Execution time Memory
865974 2023-10-25T08:21:00 Z _anhxinloi_ Potatoes and fertilizers (LMIO19_bulves) C++17
0 / 100
 1 ms 2396 KB 
#include<bits/stdc++.h>
#define int long long

using namespace std;

const int maxn = 5e5 + 5;

int n, a[maxn], b[maxn];
vector<int> g;

signed main()
{
//    freopen("test.inp" , "r" , stdin);
//    freopen("test.out" , "w" , stdout);

    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int A = 0, B = 0;
    cin >> n;
    for(int i=1 ; i<=n ; ++i){
        cin >> a[i] >> b[i];
        A += a[i];
        B += b[i];
    }

    if(A < B){
        cout << 0;
    }
}

/// code by yourlove ///

Subtask #1
0 / 24.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 36.0

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