제출 #104582

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
104582		Hassoony	Simfonija (COCI19_simfonija)	C++17	11 / 110	1071 ms	1408 KiB

simfonija

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const ll mod=(1e9+7);
const ll inf=(1ll<<61);
const int MX=50009;
int n,k,a[MX],b[MX],c[MX];
int main(){
    cin>>n>>k;
    for(int i=0;i<n;i++)scanf("%d",&a[i]);
    for(int i=0;i<n;i++)scanf("%d",&b[i]);
    for(int i=0;i<n;i++)c[i]=a[i]-b[i];
    sort(c,c+n);
    int x=c[(n-1)/2];
    ll ans=0;
    for(int i=0;i<n;i++){
        c[i]-=x;
        ans+=abs(c[i]);
    }
    cout<<ans<<endl;
}

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

simfonija.cpp: In function 'int main()':
simfonija.cpp:11:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=0;i<n;i++)scanf("%d",&a[i]);
                         ~~~~~^~~~~~~~~~~~
simfonija.cpp:12:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=0;i<n;i++)scanf("%d",&b[i]);
                         ~~~~~^~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 11
• Subtask 5: 0 / 11
• Subtask 6: 0 / 11
• Subtask 7: 0 / 11
• Subtask 8: 0 / 11
• Subtask 9: 0 / 11
• Subtask 10: 0 / 11