Submission #1015229

#TimeUsernameProblemLanguageResultExecution timeMemory
1015229UmairAhmadMirzaFireworks (APIO16_fireworks)C++17
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> using namespace std; #define int long long int const N=2e5+5; int const mod=1e9+7; int n,m; void solve1(){ int l[m+1]={0}; for (int i = 1; i <=m; ++i) { int a; cin>>a; cin>>l[i]; } int ans=1e15; for(int i=1;i<=n;i++){ int t=0; for(int j=1;j<=m;j++) t+=abs(l[j]-l[i]); ans=min(t,ans); } cout<<ans<<endl; } signed main(){ cin>>n>>m; if(n==1 && m<=100){ solve1(); return 0; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...