第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-620 不高兴的津津

#include<stdio.h>
void pd(int a[]);
int main(void)
{
  int a[7]={0};
  int i,n,m;
  for(i=0;i<7;i++)
  {
    scanf("%d",&n);
    scanf("%d",&m);
    a[i]=n+m;
  }
    pd(a);
  return 0;
  
}
void pd(int a[])
{
  int i;  
  for(i=0;i<7;i++)
  {
    if(a[i]>8)
    {
      printf("%d",i+1);
      break;
    }
  }
  if(i>7)
    printf("%d",0); 
}

#include <iostream>
#include <stdio.h>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
int main(){
  int a[14];
  int sum=0,max=0,ya=0;
  for(int i=0;i<14;i++){
    cin>>a[i];
  }
  for(int i=0;i<14;i++){
    if(sum>max){
      max=sum;
      ya=i/2;
      //cout<<ya<<endl;
    }
    sum=0;
    for(int j=i;j<i+2;j++){
      sum=sum+a[j];
    }
    i++;
  }
  cout<<ya;
  return 0;
}

import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
    static final int INF = 0x3f3f3f3f;
    static final long LNF = 0x3f3f3f3f3f3f3f3fL;
    public static void main(String[] args) throws IOException {
        initReader();
        Node[]arr=new Node[8];
        boolean g=true;
        for(int i=1;i<=7;i++){
            arr[i]=new Node();
            int a=nextInt();
            int b=nextInt();
            arr[i].sum=a+b;
            arr[i].id=i;
            if(arr[i].sum>8)g=false;
        }
        if(g)pw.println("0");
        else {
            Arrays.sort(arr, 1, 8, new Comparator<Node>() {
                @Override
                public int compare(Node node, Node t1) {
                   if(t1.sum>node.sum)return 1;
                   else if(t1.sum==node.sum){
                       if(node.id>t1.id)return 1;
                   }
                   return -1;
                }
            });
        }
        pw.println(arr[1].id);
        pw.close();
    }
    static class Node{
        int sum;int id;
    }
    /***************************************************************************************/
    static BufferedReader reader;
    static StringTokenizer tokenizer;
    static PrintWriter pw;
    public static void initReader() throws IOException {
        reader = new BufferedReader(new InputStreamReader(System.in));
        tokenizer = new StringTokenizer("");
        pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
//        从文件读写
//        reader = new BufferedReader(new FileReader("test.in"));
//        tokenizer = new StringTokenizer("");
//        pw = new PrintWriter(new BufferedWriter(new FileWriter("test1.out")));
    }
    public static boolean hasNext() {
        try {
            while (!tokenizer.hasMoreTokens()) {
                tokenizer = new StringTokenizer(reader.readLine());
            }
        } catch (Exception e) {
            return false;
        }
        return true;
    }
    public static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }
    public static String nextLine() {
        try {
            return reader.readLine();
        } catch (Exception e) {
            return null;
        }
    }
    public static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }
    public static long nextLong() throws IOException {
        return Long.parseLong(next());
    }
    public static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
    public static char nextChar() throws IOException {
        return next().charAt(0);
    }
}

hours = 8
day = 0
for i in range(0,7):
    time = input().split()
    work = int(time[0]) + int(time[1])
    if work > hours:
        hours = work
        day = i + 1
print(day)