-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathA_Helmets_in_Night_Light.cpp
53 lines (49 loc) · 1.32 KB
/
A_Helmets_in_Night_Light.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include<bits/stdc++.h>
using namespace std ;
# define int long long int
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define f(i,a,b) for(int i=a;i<b;i++)
#define in cin >>
#define out cout <<
#define nl << endl;
#define input(arr) f(i,0,arr.size()) in arr[i]
#define output(arr) f(i,0,arr.size()) out arr[i] << ' '
#define mod 1e9+7
#define ps(x,y) fixed << setprecision(y) << x
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define inf 1e18
#define sortv(a) sort(a.begin(), a.end())
int gcd(int a, int b){return b == 0 ? a : gcd(b, a % b);}
bool isprime(int x){for(int i=2;i*i<=x;i++) if(x%i==0) return 0 ;return (x==1? 0 : 1);}
void solve(int N,int pak_chanek_cost,vi a,vi b){
int ans = 0;
if(ans > pak_chanek_cost*N){
return pak_chanek_cost*N;
}
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int T;
cin>>T;
while(T--){
int N;
in N;
int pak_chanek_cost;
in pak_chanek_cost;
vi a;
f(i,0,N){
in a[i] nl;
}
vi b;
f(i,0,N){
in b[i] nl;
}
solve(N,pak_chanek_cost,a,b);
}
return 0;
}