Submission #4015448


Source Code Expand

Copy
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
            ∧_∧  
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     
    /   \     | |     
    /   / ̄ ̄ ̄ ̄/  |  
  __(__ニつ/     _/ .| .|____  
     \/____/ (u ⊃  
---------------------------------------------------------------------------------------------------*/









int N; 
ll A[101010], B[101010];
ll C[101010];
int vis[101010];
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N;
    rep(i, 0, N) cin >> A[i];
    rep(i, 0, N) cin >> B[i];
 
    ll smA = 0;
    rep(i, 0, N) smA += A[i];
 
    int ans = 0;
    rep(i, 0, N) C[i] = B[i];
    
    ll smB = 0;
    rep(i, 0, N) smB += B[i];
 
    if (smA < smB) {
        printf("-1\n");
        return;
    }
 
    ll d = smA - smB;
    vector<pair<int,int>> up;
    int ng = 0;
    int same = 0;
    rep(i, 0, N) {
        if (A[i] < B[i]) ng++;
        else if (B[i] < A[i]) up.push_back({ A[i] - B[i],i });
        else same++;
    }
 
    sort(all(up));
    fore(p, up) {
        if (p.first <= d) {
            d -= p.first;
            C[p.second] = A[p.second];
        }
    }
 
    rep(i, 0, N) if (A[i] != C[i]) ans++;
    if (d) {
        if (ans == 0) ans++;
    }
    
    cout << ans << endl;
}

Submission Info

Submission Time
Task C - Exam and Wizard
User hamayanhamayan
Language C++14 (GCC 5.4.1)
Score 400
Code Size 2279 Byte
Status AC
Exec Time 27 ms
Memory 3196 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 4
AC × 29
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt, s4.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, s1.txt, s2.txt, s3.txt, s4.txt
Case Name Status Exec Time Memory
01.txt AC 24 ms 3068 KB
02.txt AC 26 ms 3196 KB
03.txt AC 25 ms 3068 KB
04.txt AC 25 ms 3068 KB
05.txt AC 27 ms 3196 KB
06.txt AC 25 ms 3196 KB
07.txt AC 24 ms 3068 KB
08.txt AC 25 ms 3196 KB
09.txt AC 24 ms 3068 KB
10.txt AC 25 ms 3196 KB
11.txt AC 25 ms 3068 KB
12.txt AC 26 ms 3196 KB
13.txt AC 26 ms 3196 KB
14.txt AC 25 ms 3196 KB
15.txt AC 26 ms 3196 KB
16.txt AC 25 ms 3196 KB
17.txt AC 27 ms 3196 KB
18.txt AC 26 ms 3196 KB
19.txt AC 20 ms 2432 KB
20.txt AC 21 ms 2560 KB
21.txt AC 20 ms 2432 KB
22.txt AC 20 ms 2560 KB
23.txt AC 20 ms 2432 KB
24.txt AC 20 ms 2432 KB
25.txt AC 21 ms 2432 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB
s4.txt AC 1 ms 256 KB