P1252 马拉松接力赛

P1252 马拉松接力赛

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lf;
typedef unsigned long long ull;
typedef pair<ll,int>P;
const int inf = 0x7f7f7f7f;
const ll INF = 1e16;
const int N = 1e6+10;
const ull base = 131;
const ll mod =  1e9+7;
const double PI = acos(-1.0);
const double eps = 1e-4;

inline int read(){
    
    int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){
    
    if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){
    
    x=x*10+ch-'0';ch=getchar();}return x*f;}
inline string readstring(){
    
    string str;char s=getchar();while(s==' '||s=='\n'||s=='\r'){
    
    s=getchar();}while(s!=' '&&s!='\n'&&s!='\r'){
    
    str+=s;s=getchar();}return str;}
int random(int n){
    
    return (int)(rand()*rand())%n;}
void writestring(string s){
    
    int n = s.size();for(int i = 0;i < n;i++){
    
    printf("%c",s[i]);}}
ll fast_power(ll a,ll p){
    
    
    ll ans = 1;
    while(p){
    
    
        if(p&1) ans = (ans*a)%mod;
        p >>= 1;
        a = (a*a)%mod;
    }
    return ans;
}


int num[6][12];


int main(){
    
    
    //srand((unsigned)time(NULL));
    //freopen(  "out.txt","w",stdout);
    for(int i = 1;i <= 5;i++){
    
    
        for(int j = 1;j <= 10;j++){
    
    
            num[i][j] = read();
        }
    }
    int ans = inf;
    int i,j,k,m,n;
    i=j=k=m=n=0;
    for(int a = 1;a <= 10;a++){
    
    
        for(int b = 1;b <= 10;b++){
    
    
            for(int c = 1;c <= 10;c++){
    
    
                for(int d = 1;d <= 10;d++){
    
    
                    for(int e = 1;e <= 10;e++){
    
    
                        if(a+b+c+d+e>=25&&num[1][a]+num[2][b]+num[3][c]+num[4][d]+num[5][e]<ans){
    
    
                            ans = num[1][a]+num[2][b]+num[3][c]+num[4][d]+num[5][e];
                            i = a;
                            j = b;
                            k = c;
                            m = d;
                            n = e;
                        }
                    }
                }
            }
        }
    }
    printf("%d\n",ans);
    printf("%d %d %d %d %d\n",i,j,k,m,n);
    return 0;
}

猜你喜欢

转载自blog.csdn.net/weixin_42868863/article/details/114917055
今日推荐