oj.uz

Submission #1015229

# Submission time Handle Problem Language Result Execution time Memory
1015229 2024-07-06T07:41:48 Z UmairAhmadMirza Fireworks (APIO16_fireworks) C++17
0 / 100
 0 ms 348 KB 
#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;
}

Subtask #1
0 / 7.0

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

Subtask #2
0 / 19.0

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

Subtask #3
0 / 29.0

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

Subtask #4
0 / 45.0

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