oj.uz

Submission #125928

# Submission time Handle Problem Language Result Execution time Memory
125928 2019-07-06T14:21:44 Z OptxPrime Simfonija (COCI19_simfonija) C++11
44 / 110
 46 ms 4216 KB 
#include <iostream>
#include <cmath>
#include<vector>
#include <algorithm>
#include <utility>
#include<stack>
#include<queue>
#include<map>
#include <fstream>

using namespace std;

#define pb push_back
#define mp make_pair
#define ll long long

    long long a[100010],b[100010],d[100010];

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

        int n,k;
        cin>>n>>k;
        for( int i=0;i<n;i++ ) cin>>a[i];
        for( int i=0;i<n;i++ ) cin>>b[i];
        for( int i=0;i<n;i++ ) d[i] = a[i]-b[i];

        sort( d,d+n );
        int neg=0;
        for( int i=0;i<n;i++ ){
            if( d[i] <= 0 ) neg++;
        }
        long long add;
        if( neg > n-neg ){
            add= abs( d[(n-1)/2] );
        }
        else add = -abs( d[ (n-1)/2 ] );

        for( int i=0;i<n;i++ ){
            a[i]+=add;
            d[i] = abs( a[i] -b[i] );
        }
            sort( d,d+n, greater<long long>() );
            long long sum=0;
            for( int i=k;i<n;i++ ) sum+=d[i];
            cout <<sum <<endl;
        return 0;
    }

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 4088 KB Output is correct
2 Correct 41 ms 4088 KB Output is correct
3 Correct 36 ms 4216 KB Output is correct

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 4088 KB Output is correct
2 Correct 40 ms 4184 KB Output is correct
3 Correct 36 ms 4092 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 4088 KB Output is correct
2 Correct 40 ms 4044 KB Output is correct
3 Correct 36 ms 4060 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 3420 KB Output is correct
2 Correct 35 ms 4124 KB Output is correct
3 Incorrect 41 ms 4060 KB Output isn't correct

Subtask #6
0 / 11.0

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

Subtask #7
0 / 11.0

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

Subtask #8
0 / 11.0

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

Subtask #9
0 / 11.0

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

Subtask #10
0 / 11.0

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