221402026-01-14 17:22:58algoproBájital (80 pont)cpp17Wrong answer 54/80300ms1296 KiB
// UUID: dd6969cb-a372-4a10-a45d-84c0eca9f6fc
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, m;
	cin >> n >> m;
	vector<int> v(n);
	vector<int> v2(n);
	int osz1 = 0, osz2 = 0;
	for(int i = 0; i < n; i++){
		int g;
		cin >> g;
		v[i] = (g - (g%m))/m;
		v2[i] = g%m;
		osz1 += (g - (g%m))/m;
		osz2 += g%m;
	}
	if(osz1 > osz2){
		while(osz1 > osz2){
			osz1 -= 1;
			osz2 += m;
		}
		
	}
	cout << osz1;
}
SubtaskSumTestVerdictTimeMemory
base54/80
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted2/22ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted4/42ms416 KiB
8Accepted4/49ms412 KiB
9Wrong answer0/239ms1188 KiB
10Wrong answer0/2168ms1196 KiB
11Wrong answer0/239ms1192 KiB
12Wrong answer0/279ms1192 KiB
13Wrong answer0/2151ms1188 KiB
14Wrong answer0/239ms1200 KiB
15Wrong answer0/239ms1196 KiB
16Wrong answer0/2143ms1196 KiB
17Wrong answer0/2100ms1204 KiB
18Wrong answer0/270ms1272 KiB
19Wrong answer0/239ms1192 KiB
20Accepted2/264ms1192 KiB
21Accepted2/254ms1296 KiB
22Accepted2/248ms1192 KiB
23Accepted4/41ms332 KiB
24Accepted4/41ms336 KiB
25Accepted4/41ms316 KiB
26Accepted4/424ms1076 KiB
27Accepted4/441ms1196 KiB
28Accepted4/439ms1192 KiB
29Accepted4/439ms1188 KiB
30Accepted2/239ms1192 KiB
31Accepted2/239ms1196 KiB
32Time limit exceeded0/2300ms1076 KiB
33Wrong answer0/2162ms1196 KiB