排位赛3-Word Processor

排位赛3-Word Processor

题目

Bessie the cow is working on an essay for her writing class. Since her handwriting is quite bad, she decides to type the essay using a word processor.
The essay contains N words (1≤N≤100), separated by spaces. Each word is between 1 and 15 characters long, inclusive, and consists only of uppercase or lowercase letters. According to the instructions for the assignment, the essay has to be formatted in a very specific way: each line should contain no more than K (1≤K≤80) characters, not counting spaces. Fortunately, Bessie’s word processor can handle this requirement, using the following strategy:
If Bessie types a word, and that word can fit on the current line, put it on that line.
Otherwise, put the word on the next line and continue adding to that line. Of course, consecutive words on the same line should still be separated by a single space. There should be no space at the end of any line.
Unfortunately, Bessie’s word processor just broke. Please help her format her essay properly!

题意

有一段英语句子，里面有n个单词，现在要将他们重新排版，逐个重新输出，每行不能超过k个字母（不包括空格），如果超过就换行。

解法

就是简单的模拟，是今天的签到题。

代码：

#include <cstring>
#include <algorithm> 
#include <queue>
#include <cstring>
#include <iostream>
#include <stdio.h> 
using namespace std;
string st[110];
int n,k,s,len[110];

int main() 
{
	//freopen("A.in","r",stdin);
	//freopen("A.out","w",stdout);
	scanf("%d%d",&n,&k);
	for (int i=1;i<=n;i++)
	{
		cin>>st[i];
		len[i]=st[i].size();
	}
	
	for (int i=1;i<=n;i++) 
	{
		if (s+len[i]>k) 
		{
			if (s>0) printf("\n");
			cout<<st[i];
			s=len[i];
		} else 
		{
			if (s>0 )printf(" ");
			cout<<st[i];
			s+=len[i];
		}
	}
	return 0;
}