3 solutions

  • 1
    @ 2024-12-2 20:54:55
    #include<bits/stdc++.h>
    typedef long long ll;
    using namespace std;
    const int N=10010;
    struct asd{
    	int number;
    	int price;
    	int price_sum;
    };
    asd a[N];
    int s[N];
    int n;
    int sum;
    int m=1e7;
    int main(){
    
    	cin.sync_with_stdio(false);
    	ios::sync_with_stdio(0);
    	cin.tie(0);cout.tie(0);
    	cin>>n;
    	for(int i=1;i<=3;i++){
    		cin>>a[i].number>>a[i].price;
    		while(sum*a[i].number<n)sum++;
    		a[i].price_sum=sum*a[i].price;
    		if(m>a[i].price_sum){
    			m=a[i].price_sum;
    		}		
    		sum=0;
    	}
    	cout<<m;
    	
    	
    	return 0;
    }
    
    • 0
      @ 2025-6-7 22:05:47

      #include<bits/stdc++.h> typedef long long ll; using namespace std; const int N=10010; struct asd{ int number; int price; int price_sum; }; asd a[N]; int s[N]; int n; int sum; int m=1e7; int main(){

      cin.sync_with_stdio(false);
      ios::sync_with_stdio(0);
      cin.tie(0);cout.tie(0);
      cin>>n;
      for(int i=1;i<=3;i++){
      	cin>>a[i].number>>a[i].price;
      	while(sum*a[i].number<n)sum++;
      	a[i].price_sum=sum*a[i].price;
      	if(m>a[i].price_sum){
      		m=a[i].price_sum;
      	}		
      	sum=0;
      }
      cout<<m;
      
      
      return 0;
      

      } #include<bits/stdc++.h> typedef long long ll; using namespace std; const int N=10010; struct asd{ int number; int price; int price_sum; }; asd a[N]; int s[N]; int n; int sum; int m=1e7; int main(){

      cin.sync_with_stdio(false);
      ios::sync_with_stdio(0);
      cin.tie(0);cout.tie(0);
      cin>>n;
      for(int i=1;i<=3;i++){
      	cin>>a[i].number>>a[i].price;
      	while(sum*a[i].number<n)sum++;
      	a[i].price_sum=sum*a[i].price;
      	if(m>a[i].price_sum){
      		m=a[i].price_sum;
      	}		
      	sum=0;
      }
      cout<<m;
      
      
      return 0;
      

      } #include<bits/stdc++.h> typedef long long ll; using namespace std; const int N=10010; struct asd{ int number; int price; int price_sum; }; asd a[N]; int s[N]; int n; int sum; int m=1e7; int main(){

      cin.sync_with_stdio(false);
      ios::sync_with_stdio(0);
      cin.tie(0);cout.tie(0);
      cin>>n;
      for(int i=1;i<=3;i++){
      	cin>>a[i].number>>a[i].price;
      	while(sum*a[i].number<n)sum++;
      	a[i].price_sum=sum*a[i].price;
      	if(m>a[i].price_sum){
      		m=a[i].price_sum;
      	}		
      	sum=0;
      }
      cout<<m;
      
      
      return 0;
      

      } #include<bits/stdc++.h> typedef long long ll; using namespace std; const int N=10010; struct asd{ int number; int price; int price_sum; }; asd a[N]; int s[N]; int n; int sum; int m=1e7; int main(){

      cin.sync_with_stdio(false);
      ios::sync_with_stdio(0);
      cin.tie(0);cout.tie(0);
      cin>>n;
      for(int i=1;i<=3;i++){
      	cin>>a[i].number>>a[i].price;
      	while(sum*a[i].number<n)sum++;
      	a[i].price_sum=sum*a[i].price;
      	if(m>a[i].price_sum){
      		m=a[i].price_sum;
      	}		
      	sum=0;
      }
      cout<<m;
      
      
      return 0;
      

      } #include<bits/stdc++.h> typedef long long ll; using namespace std; const int N=10010; struct asd{ int number; int price; int price_sum; }; asd a[N]; int s[N]; int n; int sum; int m=1e7; int main(){

      cin.sync_with_stdio(false);
      ios::sync_with_stdio(0);
      cin.tie(0);cout.tie(0);
      cin>>n;
      for(int i=1;i<=3;i++){
      	cin>>a[i].number>>a[i].price;
      	while(sum*a[i].number<n)sum++;
      	a[i].price_sum=sum*a[i].price;
      	if(m>a[i].price_sum){
      		m=a[i].price_sum;
      	}		
      	sum=0;
      }
      cout<<m;
      
      
      return 0;
      

      } #include<bits/stdc++.h> typedef long long ll; using namespace std; const int N=10010; struct asd{ int number; int price; int price_sum; }; asd a[N]; int s[N]; int n; int sum; int m=1e7; int main(){

      cin.sync_with_stdio(false);
      ios::sync_with_stdio(0);
      cin.tie(0);cout.tie(0);
      cin>>n;
      for(int i=1;i<=3;i++){
      	cin>>a[i].number>>a[i].price;
      	while(sum*a[i].number<n)sum++;
      	a[i].price_sum=sum*a[i].price;
      	if(m>a[i].price_sum){
      		m=a[i].price_sum;
      	}		
      	sum=0;
      }
      cout<<m;
      
      
      return 0;
      

      } #include<bits/stdc++.h> typedef long long ll; using namespace std; const int N=10010; struct asd{ int number; int price; int price_sum; }; asd a[N]; int s[N]; int n; int sum; int m=1e7; int main(){

      cin.sync_with_stdio(false);
      ios::sync_with_stdio(0);
      cin.tie(0);cout.tie(0);
      cin>>n;
      for(int i=1;i<=3;i++){
      	cin>>a[i].number>>a[i].price;
      	while(sum*a[i].number<n)sum++;
      	a[i].price_sum=sum*a[i].price;
      	if(m>a[i].price_sum){
      		m=a[i].price_sum;
      	}		
      	sum=0;
      }
      cout<<m;
      
      
      return 0;
      

      } #include<bits/stdc++.h> typedef long long ll; using namespace std; const int N=10010; struct asd{ int number; int price; int price_sum; }; asd a[N]; int s[N]; int n; int sum; int m=1e7; int main(){

      cin.sync_with_stdio(false);
      ios::sync_with_stdio(0);
      cin.tie(0);cout.tie(0);
      cin>>n;
      for(int i=1;i<=3;i++){
      	cin>>a[i].number>>a[i].price;
      	while(sum*a[i].number<n)sum++;
      	a[i].price_sum=sum*a[i].price;
      	if(m>a[i].price_sum){
      		m=a[i].price_sum;
      	}		
      	sum=0;
      }
      cout<<m;
      
      
      return 0;
      

      }

      • 0
        @ 2025-6-7 22:05:38

        #include<bits/stdc++.h> typedef long long ll; using namespace std; const int N=10010; struct asd{ int number; int price; int price_sum; }; asd a[N]; int s[N]; int n; int sum; int m=1e7; int main(){

        cin.sync_with_stdio(false);
        ios::sync_with_stdio(0);
        cin.tie(0);cout.tie(0);
        cin>>n;
        for(int i=1;i<=3;i++){
        	cin>>a[i].number>>a[i].price;
        	while(sum*a[i].number<n)sum++;
        	a[i].price_sum=sum*a[i].price;
        	if(m>a[i].price_sum){
        		m=a[i].price_sum;
        	}		
        	sum=0;
        }
        cout<<m;
        
        
        return 0;
        

        }

        • 1

        Information

        ID
        402
        Time
        1000ms
        Memory
        256MiB
        Difficulty
        7
        Tags
        (None)
        # Submissions
        176
        Accepted
        41
        Uploaded By