Submission #921531

#TimeUsernameProblemLanguageResultExecution timeMemory
921531vjudge1Safety (NOI18_safety)C++17
0 / 100
2097 ms2512 KiB
#include <bits/stdc++.h> #define F first #define S second #define ent '\n' #define int long long #define pb push_back typedef long double ld; typedef long long ll; using namespace std; const int maxn = 1e6+12; const int T = 0; const int mod = 1e9+7; int n,m,k,x,y,l,r; int a[maxn],b[maxn],p[maxn],pref[maxn],fact[maxn]; string s; void solve(){ cin>>n>>m; int ans=1e18,mx=0; for(int i=1;i<=n;i++){ cin>>a[i]; mx=max(mx,a[i]); } int l=1,r=1+m; while(l<=mx){ int cal=0; for(int i=1;i<=n;i++){ if(a[i] > r){ cal+=a[i]-r; } else if(a[i] < l){ cal+=l-a[i]; } } ans=min(ans,cal); l++; r++; } cout<<ans; } //BEKSULTAN TOP signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t=1; if(T)cin>>t; while(t--)solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...