BNU19323 UVA10905 Children's Game

Time Limit: 3000ms

Memory Limit: 131072KB

This problem will be judged on  UVA. Original ID:  10905
64-bit integer IO format:  %lld      Java class name:  Main

Prev 

Submit  Status  Statistics  Discuss

  Next

Type: 

None

  None

 Graph Theory

      2-SAT

     Articulation/Bridge/Biconnected Component

     Cycles/Topological Sorting/Strongly Connected Component

     Shortest Path

          Bellman Ford

         Dijkstra/Floyd Warshall

     Euler Trail/Circuit

      Heavy-Light Decomposition

     Minimum Spanning Tree

     Stable Marriage Problem

      Trees

     Directed Minimum Spanning Tree

     Flow/Matching

          Graph Matching

             Bipartite Matching

             Hopcroft–Karp Bipartite Matching

             Weighted Bipartite Matching/Hungarian Algorithm

         Flow

              Max Flow/Min Cut

             Min Cost Max Flow

 DFS-like

      Backtracking with Pruning/Branch and Bound

      Basic Recursion

     IDA* Search

      Parsing/Grammar

     Breadth First Search/Depth First Search

     Advanced Search Techniques

          Binary Search/Bisection

         Ternary Search

 Geometry

      Basic Geometry

     Computational Geometry

     Convex Hull

      Pick's Theorem

 Game Theory

      Green Hackenbush/Colon Principle/Fusion Principle

      Nim

     Sprague-Grundy Number

  Matrix

     Gaussian Elimination

      Matrix Exponentiation

 Data Structures

      Basic Data Structures

     Binary Indexed Tree

     Binary Search Tree

      Hashing

     Orthogonal Range Search

      Range Minimum Query/Lowest Common Ancestor

      Segment Tree/Interval Tree

     Trie Tree

     Sorting

      Disjoint Set

 String

      Aho Corasick

     Knuth-Morris-Pratt

      Suffix Array/Suffix Tree

 Math

      Basic Math

     Big Integer Arithmetic

      Number Theory

         Chinese Remainder Theorem

         Extended Euclid

          Inclusion/Exclusion

         Modular Arithmetic

     Combinatorics

          Group Theory/Burnside's lemma

         Counting

     Probability/Expected Value

  Others

     Tricky

      Hardest

     Unusual

      Brute Force

     Implementation

      Constructive Algorithms

     Two Pointer

      Bitmask

     Beginner

      Discrete Logarithm/Shank's Baby-step Giant-step Algorithm

      Greedy

     Divide and Conquer

  Dynamic Programming

                   Tag it!

[PDF Link]

4th IIUC Inter-University Programming Contest, 2005
A	Childrens Game
	Input: standard input Output: standard output
	Problemsetter: Md. Kamruzzaman

There are lots of number games for children. These games are pretty easy to play but not so easy to make. We will discuss about an interesting game here. Each player will be given N positive integer. (S)He can make a big integer by appending those integers after one another. Such as if there are 4 integers as 123, 124, 56, 90 then the following integers can be made 1231245690, 1241235690, 5612312490, 9012312456, 9056124123 etc. In fact 24 such integers can be made. But one thing is sure that 9056124123 is the largest possible integer which can be made.

You may think that its very easy to find out the answer but will it be easy for a child who has just got the idea of number?

Input

Each input starts with a positive integer N (≤ 50). In next lines there are N positive integers. Input is terminated by N = 0, which should not be processed.

Output

For each input set, you have to print the largest possible integer which can be made by appending all the N integers.

Sample Input	Output for Sample Input
4 123 124 56 90 5 123 124 56 90 9 5 9 9 9 9 9 0	9056124123 99056124123 99999

https://www.bnuoj.com/v3/problem_show.php?pid=19323

输入n个数 排列成一个最大的数

暴力肯定超时

按顺序排序 (注意如果两个数长度不一样 另外考虑)

#include<bits/stdc++.h>
using namespace std;
string aa[60];
string str1,str2;

int cmp(string a,string b)
{
    if(a.length()==b.length())
        return a<b;
    else
       {// return a+b<b+a;
           str1=a+b;
           str2=b+a;
           return str1<str2;//如果前面是小的则不换 否则换
       }
}
int main()
{
    int n,i,j;
    while(scanf("%d",&n),n)
    {
        for(i=0; i<n; i++)
            cin>>aa[i];
        /*for(i=n-1; i>=0; i--)//冒泡
             for(j=0; j<i; j++)
             {
                 if(aa[j].length()==aa[j+1].length())
                 {
                     if(aa[j]>aa[j+1])//if(aa[j].compare(aa[j+1])>0)
                         swap(aa[j],aa[j+1]);

                 }
                 else
                 {
                     str1="";
                     str2="";
                     str1=aa[j]+aa[j+1];
                     str2=aa[j+1]+aa[j];
                     if(str1>str2)
                         swap(aa[j],aa[j+1]);
                 }
             }*/
        sort(aa,aa+n,cmp);
        for(i=n-1; i>=0; i--)
            cout<<aa[i];
        printf("\n");
    }
    return 0;
}